Method and system for routing a network function chain

• US 9,628,380 B2
• Filed: 03/06/2015
• Issued: 04/18/2017
• Est. Priority Date: 03/06/2015
• Status: Active Grant

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Xia, Ming, Shirazipour, Meral
• Primary Examiner(s): Nguyen, Brian D
• Assistant Examiner(s): NGUYEN, TOAN D
• Application Number:
  US14/641,240
• Publication Number:
  US 20160261495A1
• Time in Patent Office: 774 Days
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• CPC Class Codes: H04L 45/306 Route determination based on the nature of the carried application
• CPC Class Codes: H04L 45/44 Distributed routing
• CPC Class Codes: H04L 45/58 Association of routers

Abstract

In one embodiment, a request is received to route a network function chain. For each contained network function, a subgraph is generated, where each of a plurality of network elements in a network is split into two vertexes, and one edge is added between the split two vertexes for each network element that hosts that network function of the subgraph. The subgraphs are ordered and connected through connecting each vertex with one edge to another vertex with one edge in a subsequent subgraph to form a graph, where the connection is included in a representation of the network. Each edge includes a cost measure. The method selects a path from the vertex representing the source network element to the vertex representing the destination network element in the graph to route the network function chain, where each edge of the path is selected based on at least its cost measure.

Claims

1. A method implemented in an electronic device coupled to a network including a plurality of network elements, wherein traffic flows of the network pass through network function chains, wherein each network function is associated with at least one network element, the method comprising:

for each of a plurality of network functions of a network function chain, generating a subgraph, wherein a representation of each of the plurality of network elements is split into two vertexes, and an edge is added between the split two vertexes of the representation of each network element that hosts that network function of the subgraph;

ordering the subgraphs according to an order of the plurality of network functions of the network function chain;

connecting the ordered subgraphs to form a graph, wherein for each ordered subgraph except the last ordered subgraph, each vertex with an edge in the ordered subgraph being connected with an edge to another vertex with an edge in the next ordered subgraph, each connection including all paths of the network between a pair of network elements represented by the vertexes connected with the edge, and wherein each edge in the graph includes a cost measure;

determining vertexes of a representation of a source network element and a representation of a destination network element in the graph; and

selecting a path from the vertex of the representation of the source network element to the vertex of the representation of the destination network element in the graph to identify a route through the plurality of network functions of the network function chain, wherein each edge of the path is selected based on at least its cost measure.

2. The method of claim 1, further comprising:

receiving a request to route the network function chain, wherein the request includes information about the source network element, the destination network element, the plurality of network functions, and information about required capacity of the network function chain,

wherein each edge between vertexes of representations of different network elements includes a capacity measure that is associated with the capacity between the different network elements, and

wherein at least one edge of the path is selected based additionally on its capacity measure.

3. The method of claim 2, further comprising:

prior to selecting the path, removing edges in the graph that do not have a capacity measure satisfying the required capacity of the network function chain.

4. The method of claim 2, wherein selecting the path comprises selecting a path for each connection between vertexes in different ordered subgraphs from a set of lowest cost alternative paths and finding the lowest cost alternative path that satisfies the required capacity of the network function chain.

5. The method of claim 1, wherein a first portion of the plurality of network functions does not require an order for the network functions in the first portion, and a second portion of the plurality of network functions requires an order for the network functions in the second portion, and

wherein ordering the subgraphs according to the order of the plurality of network functions further comprises,

for each order permutation of the first portion of the plurality of network functions, duplicating the generated subgraph for each network function in the first portion, and

for the second portion of the plurality of network functions, ordering the generated subgraphs in that order of the second portion.

6. The method of claim 1, wherein at least one additional edge is added in one subgraph between the split two vertexes of the representation of a network element that does not currently host that network function of the subgraph but that has the capability to host that network function of the subgraph, and wherein the at least one additional edge includes a cost measure that is different from the cost measure of an edge between the split two vertexes of the representation of a network element that currently hosts that network function of the subgraph.

7. The method of claim 1, wherein the cost measure of at least one edge of the graph is calculated based at least on one of the following:

a hop count between the different network elements with representation vertexes connected by the edge;

a time delay between the different network elements with representation vertexes connected by the edge;

a distance measure between the different network elements with representation vertexes connected by the edge;

a capacity measure; and

an administrative cost.

8. The method of claim 1, wherein each network function of the plurality of network functions is implemented through network function virtualization (NFV).

9. A method implemented in an electronic device coupled to a network including a plurality of network elements, wherein traffic flows of the network pass through network function chains, wherein each network function is associated with at least one network element, the method comprising:

calculating a set of lowest cost paths for each pair of network elements of the plurality of network elements, wherein each lowest cost path includes a cost measure;

for each of a plurality of network functions of a network function chain, generating a subgraph, wherein a representation of each of the plurality of network elements is split into two vertexes, and an edge is added between the split two vertexes of the representation of each network element that hosts that network function of the subgraph;

ordering the subgraphs according to an order of the plurality of network functions of the network function chain;

connecting the ordered subgraphs to form a graph, wherein for each ordered subgraph except the last ordered subgraph, each vertex with an edge in the ordered subgraph is connected, with at least one edge, to another vertex with an edge in the next ordered subgraph, wherein each connection between vertexes in different ordered subgraphs is associated with at least one path but no more than the calculated set of lowest cost paths for the pair of network elements with representation vertexes connected by the at least one edge, and wherein each edge in the graph includes a cost measure;

determining vertexes of a representation of a source network element and a representation of a destination network element in the graph; and

selecting a path from the vertex of the representation of the source network element to the vertex of the representation of the destination network element in the graph to identify a route through the plurality of network functions of the network function chain, wherein each edge of the path is selected based on at least its cost measure.

10. The method of claim 9, wherein when the connection between vertexes in different ordered subgraphs is associated with more than one lowest cost path, the vertex with the edge in the next later-ordered subgraph is split so that the connection between the vertexes includes an edge for each of the associated calculated set of lowest cost paths, and each of these edges connects the vertex with an edge in the earlier-ordered subgraph to a unique split vertex of the next later-ordered subgraph.

11. The method of claim 9, further comprising:

receiving a request to route the network function chain, wherein the request includes information about the source network element, the destination network element, the plurality of network functions, and information about required capacity of the network function chain,

wherein each edge between vertexes of representations of different network elements includes a capacity measure that is associated with the capacity between the different network elements, and

wherein at least one edge of the path is selected based additionally on its capacity measure.

12. The method of claim 11, further comprising:

prior to selecting the path, removing edges in the graph that do not have a capacity measure satisfying the required capacity of the network function chain.

13. The method of claim 11, wherein selecting the path comprises selecting a path for each connection between vertexes in different ordered subgraphs from the set of lowest cost paths for the pair of network elements with representation vertexes connected by the at least one edge, and wherein the selected path for the connection is the lowest cost path that satisfies the required capacity of the network function chain.

14. The method of claim 9, wherein a first portion of the plurality of network functions does not require an order for the network functions in the first portion, and a second portion of the plurality of network functions requires an order for the network functions in the second portion, and

wherein ordering the subgraphs according to the order of the plurality of network functions further comprises,

for each order permutation of the first portion of the plurality of network functions, duplicating the generated subgraph for each network function in the first portion, and

for the second portion of the plurality of network functions, ordering the generated subgraphs in that order of the second portion.

15. The method of claim 9, wherein at least one additional edge is added in one subgraph between the split two vertexes of the representation of a network element that does not currently host that network function of the subgraph but that has the capability to host that network function of the subgraph, and wherein the at least one additional edge includes a cost measure that is higher than the cost measure of an edge between the split two vertexes of the representation of a network element that currently hosts that network function of the subgraph.

16. The method of claim 9, wherein each network function of the plurality of network functions is implemented through network function virtualization (NFV).

17. A non-transitory machine-readable medium having instructions stored therein, which when executed by a processor, cause the processor to perform operations in an electronic device coupled to a network including a plurality of network elements, wherein traffic flows of the network pass through network function chains, wherein each network function is associated with at least one network element, the operations comprising:

for each of a plurality of network functions of a network function chain, generating a subgraph, wherein a representation of each of the plurality of network elements is split into two vertexes, and an edge is added between the split two vertexes of the representation of each network element that hosts that network function of the subgraph;

ordering the subgraphs according to an order of the plurality of network functions of the network function chain;

connecting the ordered subgraphs to form a graph, wherein for each ordered subgraph except the last ordered subgraph, each vertex with an edge in the ordered subgraph being connected with an edge to another vertex with an edge in the next ordered subgraph, each connection including all paths of the network between a pair of network elements represented by the vertexes connected with the edge, and wherein each edge in the graph includes a cost measure;

determining vertexes of the representation of a source network element and a representation of a destination network element in the graph; and

selecting a path from the vertex of the representation of the source network element to the vertex of the representation of the destination network element in the graph to identify a route through the plurality of network functions of the network function chain, wherein each edge of the path is selected based on at least its cost measure.

18. The non-transitory machine-readable medium of claim 17, wherein a first portion of the plurality of network functions does not require an order for the network functions in the first portion, and at least one second portion of the plurality of network functions requires an order for the network functions in the at least one second portion, and

wherein ordering the subgraphs according to the order of the plurality of network functions further comprises,

for each order permutation of the first portion of the plurality of network functions, duplicating the generated subgraph for each network function in the first portion, and

for each order of the at least one second portion of the plurality of network functions, ordering the generated subgraphs in that order of the at least one second portion.

19. A non-transitory machine-readable medium having instructions stored therein, which when executed by a processor, cause the processor to perform operations in an electronic device coupled to a network including a plurality of network elements, wherein traffic flows of the network pass through network function chains, wherein each network function is associated with at least one network element, the operations comprising:

calculating a set of lowest cost paths for each pair of network elements of the plurality of network elements, wherein each lowest cost path includes a cost measure;

for each of a plurality of network functions of a network function chain, generating a subgraph, wherein a representation of each of the plurality of network elements is split into two vertexes, and an edge is added between the split two vertexes of the representation of each network element that hosts that network function of the subgraph;

ordering the subgraphs according to an order of the plurality of network functions of the network function chain;

connecting the ordered subgraphs to form a graph, wherein for each ordered subgraph except the last ordered subgraph, each vertex with an edge in the ordered subgraph is connected, with at least one edge, to another vertex with an edge in the next ordered subgraph, wherein each connection between vertexes in different ordered subgraphs is associated with at least one path but no more than the calculated set of lowest cost paths for the pair of network elements with representation vertexes connected by the at least one edge, and wherein each edge in the graph includes a cost measure;

determining vertexes of a representation of a source network element and a representation of a destination network element in the graph; and

selecting a path from the vertex of the representation of the source network element to the vertex of the representation of the destination network element in the graph to identify a route through the plurality of network functions of the network function chain, wherein each edge of the path is selected based on at least its cost measure.

20. The non-transitory machine-readable medium of claim 19, wherein at least one additional edge is added in one subgraph between the split two vertexes of the representation of a network element that does not currently host that network function of the subgraph but that has the capability to host that network function of the subgraph, and wherein the at least one additional edge includes a cost measure that is different from the cost measure of an edge between the split two vertexes of the representation of a network element that currently hosts that network function of the subgraph.