Segment routing using a remote forwarding adjacency identifier

• US 10,178,022 B2
• Filed: 08/30/2017
• Issued: 01/08/2019
• Est. Priority Date: 07/17/2014
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Previdi, Stefano B., Filsfils, Clarence
• Primary Examiner(s): Nguyen, Thai
• Application Number:
  US15/691,044
• Publication Number:
  US 20170366453A1
• Time in Patent Office: 496 Days
• CPC Class Codes: H04L 45/50 using label swapping, e.g. multi-protocol label switch [MPLS]
• CPC Class Codes: H04L 45/507 Label distribution
• CPC Class Codes: H04L 45/74 Address processing for routing

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.

Claims

1. A method comprising:

a first node generating a first segment identifier (ID);

the first node mapping the first segment ID to a label distribution protocol (LDP) label in memory;

the first node generating and sending an advertisement message to other nodes in a network of nodes, wherein the advertisement message comprises an identity of a destination node and the first segment ID;

wherein the LDP label corresponds to an LDP tunnel that exists between the first node and the destination node when the first node sends the advertisement.

2. The method of claim 1 wherein the advertisement message also comprises a nodal segment ID that is unique to the first node.

3. The method of claim 1 wherein the first node generates the first segment ID in response to the first node determining the destination node is not segment routing enabled.

4. The method of claim 1 further comprising:

the first node initializing the LDP tunnel before the first node generates the first segment ID, wherein the initializing comprises;

generating and sending a first message to a second node, which is on a path to the destinations node, wherein the first message comprises information identifying the first node, and information identifying nodes desired to be in the LDP tunnel.

5. The method of claim 4 wherein the first node receives the LDP label from the second node in response to sending the first message to the second node.

6. The method of claim 2 wherein the first segment ID is a first of a plurality of different types of segment IDs, wherein the nodal segment ID is a second type of the plurality of different types of segment IDs, wherein first type of segment ID is associated with a first predefined range of values, wherein the second type of segment ID is associated with a second predefined range of values, wherein the first and second predefined range of values do not overlap with each other.

8. The method of claim 1 further comprising:

the first node determining a second node is not segment routing (SR) enabled;

wherein the first node generates the first segment ID in response to determining the second node is not SR enabled.

7. The method of 1 wherein the first node comprises a memory that maps nodal segment IDs to identities of nodes in the network, wherein the first node generates the first segment ID in response to a determination that the memory does not map the identity of the destination to a segment ID.

9. A non-transitory computer readable memory (CRM) storing instructions, wherein a first node is capable of implementing a method in response to executing the instructions, the method comprising:

generating a first segment identifier (ID);

mapping the first segment ID to a label distribution protocol (LDP) label in memory;

generating and sending an advertisement message to other nodes in a network of nodes, wherein the advertisement message comprises an identity of a destination node and the first segment ID;

wherein the LDP label corresponds to an LDP tunnel that exists between the first node and the destination node when the first node sends the advertisement.

10. The non-transitory CRM of claim method of claim 9 wherein the advertisement message also comprises a nodal segment ID that is unique to the first node in the network.

11. The non-transitory CRM of claim 9 wherein the first node generates the first segment ID in response to the first node determining the destination node is not segment routing enabled.

12. The non-transitory CRM of claim 9 wherein the method further comprises:

initializing the LDP tunnel before the first node generates the first segment ID, wherein the initializing comprises;

generating and sending a first message to a second node, which is on a path to the destinations node, wherein the first message comprises information identifying the first node, and information identifying nodes desired to be in the LDP tunnel.

13. The non-transitory CRM of claim 9 wherein the method further comprises:

determining the second node is not segment routing (SR) enabled;

wherein the node advertises the other segment ID and the other ID in response to determining the second node is not SR enabled.

14. The non-transitory CRM of claim 13 wherein the method further comprises an act of receiving the LDP label from the second node in response to sending the first message to the second node.

15. The non-transitory CRM of claim 10 wherein the first segment ID is a first of a plurality of different types of segment IDs, wherein the nodal segment ID is a second type of the plurality of different types of segment IDs, wherein first type of segment ID is associated with a first predefined range of values, wherein the second type of segment ID is associated with a second predefined range of values, wherein the first and second predefined range of values do not overlap with each other.

16. The non-transitory CRM of claim 9 wherein the first node comprises a memory that maps nodal segment IDs to identities of nodes in the network, wherein the first node generates the first segment ID in response to a determination that the memory does not map the identity of the destination to a segment ID.

17. The non-transitory CRM of claim 9 wherein the method further comprises:

determining a second node is not segment routing (SR) enabled;

wherein the first node generates the first segment ID in response to determining the second node is not SR enabled.

18. A system comprising:

a first node coupled to a second node;

wherein the second node configured to generate and send a label distribution protocol (LDP) label to the first node;

wherein the first node is configured to generate a first segment identifier (ID);

wherein the first node is configured to map the first segment ID to the LDP label in memory in response to receiving the LDP label from the second node;

wherein the first node is configured to generate and send an advertisement message to other nodes in a network of nodes, wherein the advertisement message comprises an identity of a destination node and the first segment ID;

wherein the LDP label corresponds to an LDP tunnel that exists between the first node and the destination node when the first node sends the advertisement.

19. The system of claim 18 wherein the advertisement message also comprises a nodal segment ID that is unique to the first node.

20. The system of claim 18 wherein the first node is configured to generate the first segment ID in response to the first node determining the destination node is not segment routing enabled.