# US 2017/0257870 A1 · Systems and methods for performing traffic engineering through network slices

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

- Number: US 2017/0257870 A1
- Document ID: US20170257870A1
- Status: Published application
- Kind: A1
- Application number: 15/061,570
- Filed: 2016-03-04
- Published: 2017-09-07
- Earliest claimed: 2016-03-04
- Assignees: Huawei Technologies Co., Ltd.
- Inventors: Hamidreza FARMANBAR; Sophie VRZIC; Hang ZHANG
- Web page: https://patentgrep.com/patent/US20170257870A1

## CPC

- H04W 72/52: based on load
- H04W 16/10: Dynamic resource partitioning
- H04W 24/02: Arrangements for optimising operational condition
- H04W 24/08: Testing, {supervising or monitoring} using real traffic
- H04W 28/0247: {based on conditions of the access network or the infrastructure network (central resource management H04W28/16)}
- H04W 28/10: Flow control {between communication endpoints}
- H04W 40/04: based on wireless node resources
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Systems and methods for performing traffic engineering in a communications network using a plurality of network slices are disclosed. The network slices are configured to manage a service including transmission of data along one or more flows along nodes of the communications network using a portion of physical link resources of the communications network. The method includes allocating the portion of physical link resources of the communications network associated with a first network slice of the plurality of network slices in accordance with instructions received from a traffic engineering entity associated with the first network slice.

## Claims

### Claim 1

A method for performing traffic engineering on a communications network through a plurality of network slices, each network slice of the plurality of network slices configured to manage a service for transmitting data along one or more flows traversing nodes of the communications network using a portion of physical link resources, the method comprising:
allocating the portion of physical link resources of the communications network associated with a first network slice in the plurality of network slices in accordance with instructions received from a traffic engineering entity associated with the first network slice.

### Claim 2 (depends on 1)

The method of claim 1 wherein allocating the portion of physical link resources is performed further according to a flow based resource assignment algorithm, or a group flow based resource assignment algorithm.

### Claim 3 (depends on 2)

The method of claim 2, wherein allocating the portion of physical link resources according to the flow based resource assignment algorithm comprises:
determining the one or more flows of the service managed by the first network slice from the instructions;
performing the flow based resource assignment algorithm to determine physical link resource requirements for each of the one or more flows; and
allocating the portion of physical link resources associated with the first network slice according to the determined physical link resource requirements for each of the one or more flows.

### Claim 4 (depends on 2)

The method of claim 2, wherein allocating the portion of physical link resources according to the group flow based resource assignment algorithm comprises:
determining the one or more flows of the service managed by the first network slice from the instructions;
determining groups of flow segments from the one or more flows;
performing the group flow based resource assignment algorithm according to the determined groups of flow segments; and
allocating the portion of physical link resources associated with the first network slice according to the results of the group flow based resource assignment algorithm.

### Claim 5 (depends on 2)

The method of claim 2 wherein when the service comprises a service function chain, allocating the portion of physical link resources further comprises determining flow segments according to the service function chain.

### Claim 6 (depends on 4)

The method of claim 4 wherein each group of flow segments comprises one or more flow segments having a common starting node, a common ending node, or common starting and ending nodes.

### Claim 7 (depends on 4)

The method of claim 4 wherein the groups of flow segments are determined for each network slice of the plurality of network slices.

### Claim 8 (depends on 4)

The method of claim 4 wherein the group flow based resource assignment algorithm comprises a set of flow group conservation constraints.

### Claim 9 (depends on 8)

The method of claim 8 wherein the set of flow group conservation constraints comprises:
∑
a
∈
A
in

(
n
)

x
a
k
-
∑
a
∈
A
out

(
n
)

x
a
k
=
{
0
,
n
∉
S
k
,
n
∉
D
k
-
d
S
k

(
n
)
,
n
∈
S
k
d
D
k

(
n
)
,
n
∈
D
k
wherein n is a node in the communications network, k is a group of flow segments, a is a link in the communications network, xak is a physical resource allocation for group k on link a, dSk(n) is the total demand at a given source node n due to the group of flow segments k, dDk(n) is the total demand at a given destination node n due to the group of flow segments k, Sk is a set of source nodes for the group of flow segments k, and Dk is a set of destination nodes for the group of flow segments k.

### Claim 10 (depends on 4)

The method of claim 4 wherein the group flow based resource assignment algorithm comprises a set of link capacity constraints.

### Claim 11 (depends on 10)

The method of claim 10 wherein the set of link capacity constraints comprises:
∑
k
=
1
K


x
a
k
≤
c
a
wherein k is a group of flow segments, a is a link in the communications network, xak is a physical resource allocation for group k on link a, and Ca is a capacity of link a.

### Claim 12 (depends on 1)

The method of claim 1 further comprising providing the plurality of network slices.

### Claim 13 (depends on 12)

The method of claim 12 further comprising transmitting data according to each of the network slices along the one or more flows of the service it manages using its allocated portion of physical link resources.

### Claim 14 (depends on 1)

The method of claim 1 further comprising informing nodes of the communication network of the portion of physical link resources allocated to each network slice, and enforcing usage of the portion of physical link resources by each network slice with the nodes.

### Claim 15 (depends on 1)

The method of claim 1 further comprising allocating the portion of physical link resources of the communications network associated with each of the network slices in accordance with instructions received from traffic engineering entities associated with each of the network slices.

### Claim 16 (depends on 1)

The method of claim 1 wherein the instructions are selected from the list consisting of: point of presence information, forwarding graph information, network topology information, and network slice flow information.

### Claim 17

A resource allocation apparatus comprising:
a processor;
an input interface coupled to the processor, the input interface for receiving instructions from a traffic engineering entity associated with a first network slice from a plurality of network slices, each network slice configured to manage a service for transmitting data along one or more flows traversing nodes of a communications network;
a memory coupled to the processor, the memory having recorded thereon statements and instructions when executed by the processor to allocate a portion of physical link resources of the communications network associated with the first network slice in accordance with the instructions from the traffic engineering entity associated with the first network slice; and
an output interface for providing the portion of physical link resources associated with the first network slice for transmitting data along its one or more flows using its allocated portion of physical link resources.

### Claim 18 (depends on 17)

The resource allocation apparatus of claim 17 wherein the portion of physical link resources is allocated further according to a flow based resource assignment algorithm, or a group flow based resource assignment algorithm.

### Claim 19 (depends on 18)

The resource allocation apparatus of claim 18 wherein allocating the portion of physical link resources according to the flow based resource assignment algorithm comprises:
determining the one or more flows of the service managed by the first network slice from the instructions;
performing the flow based resource assignment algorithm to determine physical link resource requirements for each of the one or more flows; and
allocating the portion of physical link resources associated with the first network slice according to the determined physical link resource requirements for each of the one or more flows.

### Claim 20 (depends on 18)

The resource allocation apparatus of claim 18 wherein allocating the portion of physical link resources according to the group flow based resource assignment algorithm comprises:
determining the one or more flows of the service managed by the first network slice from the instructions;
determining groups of flow segments from the one or more flows;
performing the group flow based resource assignment algorithm according to the determined groups of flow segments; and
allocating the portion of physical link resources associated with the first network slice according to the results of the group flow based resource assignment algorithm.

### Claim 21 (depends on 18)

The resource allocation apparatus of claim 18 wherein when the service comprises a service function chain, the step of allocating the portion of physical link resources further comprises determining flow segments according to the service function chain.

### Claim 22 (depends on 20)

The resource allocation apparatus of claim 20 wherein each group of flow segments comprises one or more flow segments having a common starting node, a common ending node, or common starting and ending nodes.

### Claim 23 (depends on 20)

The resource allocation apparatus of claim 20 wherein the groups of flow segments are determined for each network slice of the plurality of network slices.

### Claim 24 (depends on 20)

The resource allocation apparatus of claim 20 wherein the group flow based resource assignment algorithm comprises a set of flow group conservation constraints.

### Claim 25 (depends on 24)

The resource allocation apparatus of claim 24 wherein the set of flow group conservation constraints comprises:
∑
a
∈
A
in

(
n
)

x
a
k
-
∑
a
∈
A
out

(
n
)

x
a
k
=
{
0
,
n
∉
S
k
,
n
∉
D
k
-
d
S
k

(
n
)
,
n
∈
S
k
d
D
k

(
n
)
,
n
∈
D
k
wherein n is a node in the communications network, k is a group of flow segments, a is a link in the communications network, xak is a physical resource allocation for group k on link a, dSk(n) is the total demand at a given source node n due to the group of flow segments k, dDk(n) is the total demand at a given destination node n due to the group of flow segments k, Sk is a set of source nodes for the group of flow segments k, and Dk is a set of destination nodes for the group of flow segments k.

### Claim 26 (depends on 20)

The resource allocation apparatus of claim 20 wherein the group flow based resource assignment algorithm comprises a set of link capacity constraints.

### Claim 27 (depends on 26)

The resource allocation apparatus of claim 26 wherein the set of link capacity constraints comprises:
∑
k
=
1
K


x
a
k
≤
c
a
wherein k is a group of flow segments, a is a link in the communications network, xak is a physical resource allocation for group k on link a, and Ca is a capacity of link a.

### Claim 28 (depends on 17)

The resource allocation apparatus of claim 17 wherein the output interface further informs nodes of the communications network the portion of physical link resources allocated to each network slice.

### Claim 29 (depends on 17)

The resource allocation apparatus of claim 17 wherein the input interface is further for receiving instructions from traffic engineering entities from each of the network slices, the processor further allocates the portion of physical link resources of the communications network associated with each of the network slices in accordance with instructions received from traffic engineering entities associated with each of the network slices, and the output interface further provides the portion of physical link resources associated with each of the network slices.

### Claim 30 (depends on 17)

The resource allocation apparatus of claim 17 wherein the instructions are selected from the list consisting of: point of presence information, forwarding graph information, network topology information, and network slice flow information.

### Claim 31

A non-transitory memory having recorded thereon statements and instructions for execution by a processor, the statements and instructions comprising allocating a portion of physical link resources of a communications network to each network slice of a plurality of network slices, wherein each network slice is configured to transmit data along one or more associated flows over the communications network using its allocated portion of physical link resources.

### Claim 32

A method for performing traffic engineering in a communications network through a first network slice managing a first service, and a second network slice managing a second service, the method comprising:
transmitting or receiving data associated with the first service according to the first network slice; and
transmitting or receiving data associated with the second service according to the second network slice.

### Claim 33 (depends on 32)

The method of claim 32 wherein the first network slice is allocated a first portion of physical link resources of the communications network, and the second network slice is allocated a second portion of physical link resources of the communications network, wherein the data associated with the first service is transmitted or received using the first portion of physical link resources allocated to the first network slice, and the data associated with the second service is transmitted or received using the second portion of physical link resources allocated to the second network slice

### Claim 34 (depends on 32)

The method of claim 32 wherein transmitting or receiving data is performed according to traffic engineering functions of the first and second network slices, respectively.

### Claim 35

A network node comprising:
a processor;
an input interface coupled to the processor for receiving a first control signal from a first network slice, data associated with a first service managed by the first network slice, a second control signal from a second network slice, and data associated with a second service managed by the second network slice;
a memory coupled to the processor and having stored thereon statements and instructions when executed by the processor to receive or transmit the data associated with the first service according to the first control signal, and receive or transmit the data associated with the second service according to the second control signal; and
an output interface coupled to the processor for transmitting the data associated with the first service, and transmitting the data associated with the second service.

### Claim 36 (depends on 35)

The network node of claim 35 wherein the first network slice is allocated a first portion of physical link resources of a communications network, and the second network slice is allocated a second portion of physical link resources of the communications network, wherein receiving or transmitting the data associated with the first service is performed using the first portion, and receiving or transmitting the data associated with the second service is performed using the second portion.
