# US 2021/0083940 A1 · Method and apparatus for creating network slices

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0083940 A1
- Document ID: US20210083940A1
- Status: Published application
- Kind: A1
- Application number: 17/103,924
- Filed: 2020-11-24
- Published: 2021-03-18
- Earliest claimed: 2018-09-25
- Assignees: Zte Corporation
- Applicants: Zte Corporation
- Inventors: Shaofu PENG; Baoya ZHANG
- Web page: https://patentgrep.com/patent/US20210083940A1

## CPC

- H04L 41/0806: for initial configuration or provisioning, e.g. plug-and-play
- H04L 41/0894: Policy-based network configuration management
- H04L 45/123: {Evaluation of link metrics (techniques for monitoring network metrics H04L43/08)}
- H04L 45/507: {Label distribution}
- H04L 47/803: {Application aware}
- H04W 36/00: Hand-off or reselection arrangements
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Disclosed are a method and an apparatus for creating network slices. The method for creating network slices comprises: creating a slice-bundles link between a first node and a second node, wherein the slice-bundles link comprises at least one member link created between the first node and the second node; and configuring a packet service for the slice-bundles link.

## Claims

### Claim 1

A method for creating network slices, comprising:
creating a slice-bundles link between a first node and a second node, wherein, the slice-bundles link comprises at least one member link between the first node and the second node; and
configuring a packet service for the slice-bundles link.

### Claim 2 (depends on 1)

The method of claim 1, wherein before creating the slice-bundles link between the first node and the second node, the method further comprises:
creating the at least one member link between the first node and the second node; and
configuring, for each member link, a slice to which the member link belongs, and configuring, for each node, a slice to which the node belongs.

### Claim 3 (depends on 1)

The method of claim 1, wherein the creating the slice-bundles link between the first node and the second node comprises:
creating interconnected slice-bundles interfaces on the first node and the second node respectively, and adding the at least one member link to the slice-bundles interfaces as a member interface.

### Claim 4 (depends on 2)

The method of claim 2, wherein the configuring, for each member link, the slice to which the member link belongs, and configuring, for each node, the slice to which the node belongs comprises:
configuring, for each member link, at least one slice attribute of the member link; and configuring, for each node, at least one slice attribute of the node.

### Claim 5 (depends on 3)

The method of claim 3, wherein the configuring the packet service for the slice-bundles link comprises configuring the packet service on the slice-bundles interfaces.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
flooding link state information and maintaining a consistent link state database on each node;
wherein, the link state database records the flooded link state information, and the link state information carries a slice attribute of each node and carries state information and a slice attribute of each member link.

### Claim 7 (depends on 6)

The method of claim 6, further comprising:
performing slice path calculation based on the link state database.

### Claim 8 (depends on 7)

The method of claim 7, wherein performing slice path calculation comprises:
performing a constrained shortest path first (CSPF) calculation to calculate a shortest path from the first node to all other destination nodes in the first slice to which the first node belongs, wherein, constraint conditions for performing the CSPF calculation are {slice-id of the first slice, igp-metric is the smallest}; and the calculation comprises: matching a slice attribute of each member link contained in the slice-bundles link and a slice attribute of each node according to the constraint conditions to obtain an optimal next hop forwarded by the shortest path of the first slice; or
performing a CSPF calculation based on the link state database to calculate a TE path from the first node to a destination node in the first slice to which the first node belongs, wherein, constraint conditions for performing the CSPF calculation are {slice-id of the first slice, a constraint condition A}, the constraint condition A comprises at least one of bandwidth, delay, affinity, TE metric, and maximum number of hops; and the calculation comprises: matching a slice attribute of each member link contained in the slice-bundles link and a slice attribute of each node according to the constraint conditions to obtain the TE path of the first slice; or
requesting a controller to perform a CSPF calculation based on the link state database to calculate a TE path from the first node to a destination node in the first slice to which the first node belongs, wherein, constraint conditions for performing the CSPF calculation are {slice-id of the first slice, a constraint condition A}, the constraint condition A comprises at least one of bandwidth, delay, affinity, TE metric, and maximum number of hops; and the calculation comprises: matching a slice attribute of each member link contained in the slice-bundles link and a slice attribute of each node according to the constraint conditions to obtain the TE path of the first slice.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
forwarding messages along the slice-bundles link.

### Claim 10 (depends on 9)

The method of claim 9, further comprising:
setting a priority for each member link in the slice-bundles link according to a local policy.

### Claim 11 (depends on 10)

The method of claim 10, wherein the forwarding the messages along the slice-bundles link comprises:
in a process of forwarding a protocol message in a control plane along the slice-bundles link, selecting an effective member link with the highest priority from the slice-bundles link for forwarding.

### Claim 12 (depends on 9)

The method of claim 9, wherein forwarding the messages along the slice-bundles link comprises:
in a process of forwarding a data message in a data plane along the slice-bundles link, selecting a dedicated member link of the slice to which the data message belongs from the slice-bundles link for forwarding; and
if the dedicated member link of the slice to which the data message belongs is invalid, discarding the data message.

### Claim 13 (depends on 1)

The method of claim 1, further comprising:
creating a new member link when creating a new slice;
configuring the new member link as belonging to the new slice; and
adding the new member link to the slice-bundles link.

### Claim 14 (depends on 1)

The method of claim 1, wherein the configuring the packet service comprises configuring at least one of IP address, enabling intermediate system to intermediate system (ISIS), resource reservation protocol traffic engineering (RSVP-TE), open shortest path first (OSPF) and label distribution protocol (LDP).

### Claim 15 (depends on 1)

The method of claim 1, wherein the member link comprises one of the following:
flexible Ethernet channel (FlexE channel), aggregated link, Ethernet link, Ethernet VLAN sub-interface and P2P link.

### Claim 16 (depends on 1)

The method of claim 1, wherein all slices are homogeneous networks or heterogeneous networks.

### Claim 17 (depends on 1)

The method of claim 1, wherein the first node and the second node belong to a same autonomous system AS domain; or the first node and the second node belong to different AS domains, respectively.

### Claim 18

An apparatus for creating network slices, comprising a memory, a processor, and a computer program stored on the memory and run on the processor, when executed by the processor, the computer program implements a method for creating network slices, wherein, the method comprises:
creating a slice-bundles link between a first node and a second node, wherein, the slice-bundles link comprises at least one member link between the first node and the second node; and
configuring a packet service for the slice-bundles link.

### Claim 19

A computer-readable storage medium stored with an information processing program, wherein, when executed by a processor, the information processing program implements a method for creating network slices , wherein, the method comprises:
creating a slice-bundles link between a first node and a second node, wherein, the slice-bundles link comprises at least one member link between the first node and the second node; and
configuring a packet service for the slice-bundles link.
