Segment routing using a remote forwarding adjacency identifier
AssigneeCisco Technology, Inc.
InventorsStefano B. Previdi, Clarence Filsfils
Life of this patent
Estimating the term…
Abstract
Disclosed is an apparatus and method for segment routing using a remote forwarding adjacency identifier. In one embodiment, a first node in a network receives a packet, wherein the packet is received with a first segment-ID and another segment ID attached thereto. The first node detaches the first and the other segment IDs from the packet. Then the first node attaches a first label to the packet. Eventually, the first node forwards the packet with the attached first label directly to a second node in the network. In one embodiment, the other segment ID corresponds to a forwarding adjacency or tunnel label switched path between the first node and another node.
Claims20
A method comprising:
- calculating a shortest path (SPT) between a segment routing (SR) enabled edge node and a label distribution protocol (LDP) enabled edge node in a network, wherein the SPT comprises a plurality of nodes;
- identifying an SR enabled node of the plurality, which is the nearest SR enabled node of the plurality to the LDP enabled edge node;
- identifying a first segment identifier (ID) that is mapped in memory to the SR enabled node;
- identifying a second segment ID that is mapped in memory to an identifier of the LDP enabled edge node;
- creating a segment ID stack that comprises a first and second segment IDs;
- mapping the segment ID stack in memory to the LDP enabled edge node identifier.
A non-transitory computer readable memory (CRM) storing instructions, wherein a node is capable of implementing a method in response to executing the instructions, the method comprising:
- calculate a shortest path (SPT) between a segment routing (SR) enabled edge node and a label distribution protocol (LDP) enabled edge node in a network, wherein the SPT comprises a plurality of nodes;
- identify an SR enabled node of the plurality, which is the nearest SR enabled node of the plurality to the LDP enabled edge node;
- identify a first segment identifier (ID) that is mapped in memory to the SR enabled node;
- identify a second segment ID that is mapped in memory to an identifier of the LDP enabled edge node;
- create a segment ID stack that comprises a first and second segment IDs;
- map the segment ID stack in memory to the LDP enabled edge node identifier.
A system comprising:
- a segment routing (SR) enabled edge node;
- a label distribution protocol (LDP) enabled edge node;
- wherein the SR enabled edge node is configured to:
- calculate a shortest path (SPT) between the SR enabled edge node and the LDP enabled edge node in a network, wherein the SPT comprises a plurality of intermediate nodes;
- identify an SR enabled node of the plurality, which is the topologically nearest SR enabled node of the plurality to the LDP enabled edge node;
- identify a first segment identifier (ID) that is mapped in memory to the SR enabled node;
- identify a second segment ID that is mapped in memory to an identifier of the LDP enabled edge node;
- create a segment ID stack that comprises a first and second segment IDs;
- map the segment ID stack in memory to the LDP enabled edge node identifier.
Dependencies are inferred from the claim text.