Point-to-multipoint path computation for wide area network optimization

1. A method comprising:

obtaining, by a controller of a network, configuration information for at least one point-to-multipoint label switched path (P2MP LSP);

obtaining, by the controller from the network via at least one protocol, network topology information defining a network topology for the network;

determining, by the controller based on the network topology, a first solution comprising first respective paths through the network for the at least one P2MP LSP;

determining, by the controller in response to determining the first respective paths through the network for the at least one P2MP LSP do not comprise diverse paths for a first P2MP LSP of the at least one P2MP LSP, a penalty for the first solution, wherein a total cost for the first solution includes the penalty for the first solution;

determining, by the controller after generating a modified network topology based on the network topology, a second solution comprising second respective paths through the network for the at least one P2MP LSP; and

outputting, by the controller for configuring the network, topology data for the solution of the first solution and the second solution having a lowest total cost, the lowest total cost of the solution including a total resource cost to the network for the solution.

2. The method of claim 1 , further comprising:

obtaining, by the controller, abstract link data that indicates at least one Shared Risk Link Group for each of a plurality of candidate links,

wherein determining the first solution comprising first respective paths comprises determining, by the controller based on the network topology and the abstract link data, the first solution comprising the first respective paths.

3. The method of claim 2 ,

wherein the abstract link data indicates a common Shared Risk Link Group for a first candidate link and a second candidate link of the plurality of candidate links,

wherein determining the first solution comprising first respective paths through the network for the at least one P2MP LSP comprises determining, by the controller based on the network topology and the common Shared Risk Link Group, a diverse first path and second path for a second P2MP LSP of the at least one P2MP LSP, the diverse first path and the second path determined to have path diversity such that the first path includes both the first candidate link and the second candidate link and the second path includes neither the first candidate link nor the second candidate link.

4. The method of claim 1 , wherein obtaining abstract link data comprises receiving, by the controller, an abstract link data structure for a transport network underlying the network in a multi-layer network, the abstract link data structure including the abstract link data.

5. The method of claim 1 , further comprising:

obtaining, by the controller from the network via the at least one protocol, updated network topology information defining an updated network topology for the network;

determining, by the controller based on the updated network topology and in response to obtaining the updated network topology information, a new first solution comprising new first respective paths through the network for the at least one P2MP LSP;

determining, by the controller after generating an updated modified network topology based updated network topology, a new second solution comprising new second respective paths through the network for the at least one P2MP LSP; and

outputting, by the controller for configuring the network, topology data for the solution of the new first solution and the new second solution having the lowest total cost.

6. The method of claim 1 ,

wherein generating a modified network topology comprises one of blocking, by the controller, a link of a plurality of links in the network topology by applying a link penalty to a metric for the link and unblocking, by the controller, the link by removing the link penalty to the metric for the link, and

wherein determining the second solution comprising second respective paths through the network for the at least one P2MP LSP comprises determining the second solution based at least in part on blocking or unblocking the link.

7. The method of claim 1 , wherein the modified network topology comprises a first modified network topology, the method further comprising:

determining, by the controller based on the first modified network topology and in response to determining the second solution has a lower total cost than the first solution, a third solution comprising third respective paths through the network for the at least one P2MP LSP; and

determining, by the controller after generating a second modified network topology based on the network topology in response to determining the second solution has a higher total cost than the first solution, a fourth solution comprising fourth respective paths through the network for the at least one P2MP LSP.

8. The method of claim 1 , further comprising:

determining, by the controller, a magnitude of a total cost increase for the second solution from the first solution; and

determining, by the controller, a result of a simulated annealing function based on the magnitude of the total cost increase and a temperature parameter.

9. The method of claim 1 , further comprising:

setting, by the controller, the temperature parameter according to facilitate a target probability for the simulated annealing function, the target probability a probability that a total cost for the second solution from the first solution increases.

10. The method of claim 1 , wherein the modified network topology comprises a first modified network topology, the method further comprising:

determining, by the controller, a magnitude of a total cost increase for the second solution from the first solution;

determining, by the controller, a result of a simulated annealing function based on the magnitude of the total cost increase and a temperature parameter;

determining, by the controller after generating a second modified network topology based on the modified network topology and only if the result of the simulated annealing function is positive, a third solution comprising third respective paths through the network for the at least one P2MP LSP; and

determining, by the controller after generating a third modified network topology based on the first modified network topology and only if the result of the simulated annealing function is negative, a fourth solution comprising fourth respective paths through the network for the at least one P2MP LSP.

11. The method of claim 1 ,

iteratively determining, by the controller for a number of iterations, additional solutions comprising paths through the network for the at least one P2MP LSP,

wherein outputting topology data for the solution of the first solution and the second solution having the lowest total cost comprises outputting, by the controller for configuring the network, topology data for the solution of the first solution, the second solution, and the additional solutions having the lowest total cost.

12. The method of claim 1 ,

wherein determining a first solution comprising first respective paths through the network for the at least one P2MP LSP comprises determining, by the controller, diverse paths for a second P2MP LSP of the at least one P2MP LSP.

13. A controller for a network, the controller comprising:

one or more processors coupled to a memory;

a path computation module configured for execution by the one or more processors to:

obtain configuration information for at least one point-to-multipoint label switched path (P2MP LSP);

obtain, from the network via at least one protocol, network topology information defining a network topology for the network;

determine, based on the network topology, a first solution comprising first respective paths through the network for the at least one P2MP LSP;

determine, in response to a determination that the first respective paths through the network for the at least one P2MP LSP do not comprise diverse paths for a first P2MP LSP of the at least one P2MP LSP, a penalty for the first solution, wherein a total cost for the first solution includes the penalty for the first solution;

determine, after generating a modified network topology based on the network topology, a second solution comprising second respective paths through the network for the at least one P2MP LSP; and

a path provisioning module configured for execution by the one or more processors to:

output, for configuring the network, topology data for the solution of the first solution and the second solution having the lowest total cost.

14. The controller of claim 13 ,

wherein the path computation module is further configured for execution by the one or more processors to obtain abstract link data that indicates at least one Shared Risk Link Group for each of a plurality of candidate links,

wherein to determine the first solution comprising first respective paths the path computation module is configured to determine, based on the network topology and the abstract link data, the first solution comprising the first respective paths.

15. The controller of claim 14 ,

wherein the abstract link data indicates a common Shared Risk Link Group for a first candidate link and a second candidate link of the plurality of candidate links,

wherein to determine the first solution comprising first respective paths through the network for the at least one P2MP LSP the path computation module is configured to determine, based on the network topology and the common Shared Risk Link Group, a diverse first path and second path for a second P2MP LSP of the at least one P2MP LSP, the diverse first path and the second path determined to have path diversity such that the first path includes both the first candidate link and the second candidate link and the second path includes neither the first candidate link nor the second candidate link.

16. The controller of claim 13 , wherein to obtain the abstract link data the path computation module is configured to receive an abstract link data structure for a transport network underlying the network in a multi-layer network, the abstract link data structure including the abstract link data.

17. The controller of claim 13 ,

wherein the path computation module is further configured for execution by the one or more processors to:

obtain, from the network via the at least one protocol, updated network topology information defining an updated network topology for the network;

determine, based on the updated network topology and in response to obtaining the updated network topology information, a new first solution comprising new first respective paths through the network for the at least one P2MP LSP;

determine, after generating an updated modified network topology based updated network topology, a new second solution comprising new second respective paths through the network for the at least one P2MP LSP, and

wherein the path provisioning module is further configured for execution by the one or more processors to:

output, for configuring the network, topology data for the solution of the new first solution and the new second solution having the lowest total cost.

18. The controller of claim 13 ,

wherein to generate the modified the network topology the path computation module is further configured for execution by the one or more processors to one of blocking a link of a plurality of links in the network topology by applying a link penalty to a metric for the link and unblocking the link by removing the link penalty to the metric for the link, and

wherein to determine the second solution comprising second respective paths through the network for the at least one P2MP LSP the path computation module determines the second solution based at least in part on the blocking or unblocking of the link.

19. A non-transitory computer-readable medium comprising instructions for causing one or more programmable processors of a controller of a network to:

obtain configuration information for at least one point-to-multipoint label switched path (P2MP LSP);

obtain, from the network via at least one protocol, network topology information defining a network topology for the network;

determine, based on the network topology, a first solution comprising first respective paths through the network for the at least one P2MP LSP;

determine, in response to determining the first respective paths through the network for the at least one P2MP LSP do not comprise diverse paths for a first P2MP LSP of the at least one P2MP LSP, a penalty for the first solution, wherein a total cost for the first solution includes the penalty for the first solution;

determine, after generating a modified network topology based on the network topology, a second solution comprising second respective paths through the network for the at least one P2MP LSP; and

output, for configuring the network, topology data for the solution of the first solution and the second solution having the lowest total cost.