Granted Patent B2

US 12,363,022 · App. 18/456,731 · Granted Jul 15, 2025

Inventors: Bhupendra Yadav (Ottawa, CA); Prabhu Vaithilingam (Kanata, CA); Gerald Smallegange (Stittsville, CA); Alwyn Joy George (Harinagar, IN)

Assignee: Ciena Corporation

H04L45/02H04L12/4633H04L45/12

Abstract

Claims (32)

1. A non-transitory computer-readable medium comprising instructions that, when executed, cause one or more processors to implement steps, for a Segment Routing network that utilizes Flexible Algorithm, wherein the steps include:

responsive to a Flex Algo Definition (FAD) of an auto-mesh plane, providing an advertisement of a Prefix Segment Identifier (SID) for a node in the auto-mesh plane;

including a flag in the advertisement designating whether the node is a destination node or a non-destination node in the auto-mesh plane; and

checking the flag in a received advertisement associated with another node, and, when the node is a destination node which requires transport connectivity based on the flag in the received advertisement, automatically creating transport or triggering the transport to the another node in the auto-mesh plane, wherein the transport includes an encapsulated tunnel between the node and the another node.

2. The non-transitory computer-readable medium of claim 1 , wherein the destination node is one which requires transport connectivity to all other destination nodes in the auto-mesh plane, and the non-destination node is one used for reachability to all the destination nodes.

3. The non-transitory computer-readable medium of claim 1 , wherein the steps include

receiving advertisements from other nodes in the networks, the advertisements from the other nodes designate the other nodes are in the auto-mesh plane and whether the other nodes are each a destination node or a non-destination node, wherein the non-destination node is one used for reachability to the destination nodes.

4. The non-transitory computer-readable medium of claim 1 , wherein the steps include

receiving the FAD of the auto-mesh plane based on a FAD Type-Length-Value (TLV) for one of Open Shortest Path First (OSPF) and Intermediate System-Intermediate System (ISIS).

5. The non-transitory computer-readable medium of claim 4 , wherein the FAD TLV includes a sub-sub TLV that determines the FAD is auto-mesh capable.

6. The non-transitory computer-readable medium of claim 1 , wherein the advertisement is a Prefix-SID sub-TLV.

7. An apparatus comprising:

one or more processors; and

memory storing instructions that, when executed, cause the one or processors to:

responsive to a Flex Algo Definition (FAD) of an auto-mesh plane, provide an advertisement of a Prefix Segment Identifier (SID) for a node in the auto-mesh plane,

including a flag in the advertisement designating whether the node is a destination node or a non-destination node in the auto-mesh plane, and

check the flag in a received advertisement associated with another node, and, when the node is a destination node which requires transport connectivity based on the flag in the received advertisement, automatically create transport or trigger the transport to the another node in the auto-mesh plane, wherein the transport includes an encapsulated tunnel between the node and the another node the node.

8. The apparatus of claim 7 , wherein the destination node is one which requires transport connectivity to all other destination nodes in the auto-mesh plane, and the non-destination node is one used for reachability to all the destination nodes.

9. The apparatus of claim 8 , wherein the instructions that, when executed, further cause the one or processors to

receive advertisements from other nodes in the networks, the advertisements from the other nodes designate the other nodes are in the auto-mesh plane and whether the other nodes are each a destination node or a non-destination node.

10. The apparatus of claim 8 , wherein the steps include

receiving the FAD of the auto-mesh plane based on a FAD Type-Length-Value (TLV) for one of Open Shortest Path First (OSPF) and Intermediate System-Intermediate System (ISIS).

11. The apparatus of claim 10 , wherein the FAD TLV includes a sub-sub TLV that determines the FAD is auto-mesh capable.

12. A method associated with a Segment Routing network that utilizes Flexible Algorithm, the method comprising steps of:

responsive to a Flex Algo Definition (FAD) of an auto-mesh plane, providing an advertisement of a Prefix Segment Identifier (SID) for a node in the auto-mesh plane;

including a flag in the advertisement designating whether the node is a destination node or a non-destination node in the auto-mesh plane; and

checking the flag in a received advertisement associated with another node, and, when the node is a destination node which requires transport connectivity based on the flag in the received advertisement, automatically creating transport or triggering the transport to the another node in the auto-mesh plane, wherein the transport includes an encapsulated tunnel between the node and the another node.

13. The method of claim 12 , wherein the destination node is one which requires transport connectivity to all other destination nodes in the auto-mesh plane, and the non-destination node is one used for reachability to all the destination nodes.

14. The method of claim 12 , wherein the steps include

receiving advertisements from other nodes in the networks, the advertisements from the other nodes designate the other nodes are in the auto-mesh plane and whether the other nodes are each a destination node or a non-destination node.

15. The method of claim 12 , wherein the steps include

receiving the FAD of the auto-mesh plane based on a FAD Type-Length-Value (TLV) for one of Open Shortest Path First (OSPF) and Intermediate System-Intermediate System (ISIS).

Assignments (1)

Priority Claims (1)

Continuity (1)

References Cited (28)