US 12,267,231 B2
Dynamic path computation in networks based on automatically detected unavoidable risks
Bhupendra Yadav, Ottawa (CA); Prabhu Vaithilingam, Kanata (CA); and Gerald Smallegange, Stittsville (CA)
Assigned to Ciena Corporation, Hanover, MD (US)
Filed by Ciena Corporation, Hanover, MD (US)
Filed on Aug. 29, 2022, as Appl. No. 17/897,675.
Prior Publication US 2024/0073125 A1, Feb. 29, 2024
Int. Cl. H04L 45/28 (2022.01); H04L 45/036 (2022.01)
CPC H04L 45/28 (2013.01) [H04L 45/036 (2022.05)] 19 Claims
OG exemplary drawing
 
1. A non-transitory computer-readable medium comprising instructions that, when executed, cause one or more processors to perform steps of:
receiving a plurality of shared risks associated with any of one or more network layers, network links, and network equipment;
automatically creating a local ignore list for a source node and a remote ignore list for a destination node, based on the plurality of shared risks, wherein the automatically creating includes a k-shortest path computation and taking an intersection of the plurality of shared risks at the source and the destination on all k shortest paths; and
utilizing the plurality of shared risks in a path computation for a path between the source node and the destination node and ignoring any of the plurality of shared risks in the local ignore list and the remote ignore list.