US 11,909,622 B1
Extended protection in segment routing flexible algorithm
Bhupendra Yadav, Ottawa (CA); Prabhu Vaithilingam Vaithilingam, Kanata (CA); Gerald Smallegange, Stittsville (CA); and Alwyn Joy George, Harinagar (IN)
Assigned to Ciena Corporation, Hanover, MD (US)
Filed by Ciena Corporation, Hanover, MD (US)
Filed on Jun. 27, 2023, as Appl. No. 18/342,238.
Claims priority of application No. 202311033950 (IN), filed on May 15, 2023.
Int. Cl. H04L 45/02 (2022.01); H04L 45/28 (2022.01); H04L 45/00 (2022.01)
CPC H04L 45/02 (2013.01) [H04L 45/22 (2013.01); H04L 45/28 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A non-transitory computer-readable medium comprising instructions that, when executed, cause one or more processor to implement steps, for a Segment Routing network that utilizes Flexible Algorithm, wherein the steps include:
defining a first Flexible Algorithm that segregates the Segment Routing network into a first subset network that excludes any of links and nodes from the Segment Routing network;
defining a second Flexible Algorithm that segregates the Segment Routing network into a second subset network, different from the first subset network; and
defining extended protection for the first Flexible Algorithm with the second Flexible Algorithm whereby the second Flexible Algorithm is usable to protect one or more of a path, a node, and a link available in the first Flexible Algorithm.