ENERGY EFFICIENT CONNECTIONLESS ROUTING WITH SIMPLE LOOKUP

• US 20130077630A1
• Filed: 09/28/2011
• Published: 03/28/2013
• Est. Priority Date: 09/28/2011
• Status: Abandoned Application

• Current Assignee: Alcatel-Lucent SA (Nokia Corporation)
• Original Assignee: Alcatel-Lucent SA (Nokia Corporation)
• Inventors: Bejerano, Yigal, Francini, Andrea
• Application Number:
  US13/247,477
• Publication Number:
  US 20130077630A1
• Time in Patent Office: Days
• US Class Current: 370/392
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/50 using label swapping, e.g. multi-protocol label switch [MPLS]

Abstract

An energy efficient connectionless routing method with simple lookup is disclosed for reducing the number of address lookups associated with a message packet. The energy efficient connectionless routing method with simple lookup includes determining a label sequence which will allow the message packet to traverse a plurality of MPLS domains and affixing the label sequence to the header of the message packet. This allows the message packet to traverse a plurality of MPLS domains without requiring a subsequent IP address lookup at every MPLS domain boundary. The energy efficient connectionless routing method with simple lookup is particularly useful for reducing power consumption associated with TCAM operations during IP address lookups. In addition, a Label Sequencing Edge Router is disclosed for performing the method.

Claims

1. A method of routing a message packet having a destination address across a plurality of MPLS domains in a network, said method comprising the steps of:

receiving said message packet at an ingress port of a Label Sequencing Edge Router;

determining by said Label Sequencing Edge Router based upon said destination address a Label Sequence sufficient to traverse those intervening MPLS domains of said plurality of MPLS domains between said Label Sequencing Edge Router and said destination address;

modifying by said Label Sequencing Edge Router the header of said message packet by affixing said Label Sequence to said header; and

forwarding by said Label Sequencing Edge Router said message packet with modified header into the MPLS tunnels denoted by said Label Sequence.

2. A method as claimed in claim 1 wherein

said Label Sequence comprises a plurality of MPLS shim headers and wherein each MPLS shim header contains a label identifying a respective tunnel of said intervening MPLS domains.

3. A method as claimed in claim 2 wherein

said MPLS shim headers are inserted in an order with respect to the sequence of said intervening MPLS domains along the packet route defined by said Label Sequence.

4. A method as claimed in claim 3 wherein

said order is a reverse order with respect to the sequence of said intervening MPLS domains along the packet route defined by said Label Sequence such that the outer label closest to the MAC header identifies a tunnel in the first MPLS domain to be traversed, and such that the innermost label closest to the IP header identifies a tunnel in the last MPLS domain to be traversed.

5. A method as claimed in claim 2 wherein an egress Label Edge router at a peering point between an adjacent pair of intervening MPLS domains performs the additional steps of:

modifying the Label Sequence within the header of said message packet; and

subsequently forwarding the message packet to the adjacent MPLS domain.

6. A method as claimed in claim 5 wherein the modifying step comprises:

removing the topmost remaining MPLS shim header.

7. A method as claimed in claim 1 wherein said determining step comprises retrieving a Label Sequence from a data store according to said destination address.

8. A method as claimed in claim 7 wherein if said retrieving step cannot locate a Label Sequence in said data store, then said Label Sequence Edge Router performs the additional step of initiating a Label Sequence discovery process.

9. A method as claimed in claim 8 wherein said initiating step comprises requesting a Label Sequence from a Path Computation Element.

10. A method as claimed in claim 9 wherein said Path Computational Element is an element in a centralized Path Computational Element architecture.

11. A method as claimed in claim 9 wherein said Path Computational Element is an element in a distributed Path Computational Element architecture.

12. A Label Sequencing Edge Router for forwarding a message packet having a destination address across a plurality of MPLS domains in a network, said Label Sequencing Edge Router comprising:

an ingress port for receiving said message packet;

a Label Sequence data store for storing Label Sequences appropriate to specific destination addresses;

a header modifier for modifying the header of said message packet by affixing a Label Sequence retrieved from said Label Sequence data store; and

an egress port for forwarding said message packet with modified header into the MPLS tunnels denoted by said Label Sequence.

13. A Label Sequencing Edge Router as claimed in claim 12, further comprising:

a Label Sequence requester for requesting Label Sequences from a Path Computation Element.

14. A Label Sequencing Edge Router as claimed in claim 13, wherein

said Label Sequence requester is adapted for requesting Label Sequences from a centralized architecture Path Computation Element.

15. A Label Sequencing Edge Router as claimed in claim 13, wherein

said Label Sequence requester is adapted for requesting Label Sequences from a distributed architecture Path Computation Element.

16. An article of manufacture for use in programming a Label Sequencing Edge Router, the article of manufacture comprising tangible and non-transitory computer useable media accessible to the Label Sequencing Edge Router, wherein the computer useable media includes at least one computer program that is capable of causing the Label Sequencing Edge Router to perform the steps of:

receiving a message packet having a destination address at an ingress port of said Label Sequencing Edge Router;

determining by said Label Sequencing Edge Router based upon said destination address a Label Sequence sufficient to traverse those intervening MPLS domains of said plurality of MPLS domains between said Label Sequencing Edge Router and said destination address;

modifying by said Label Sequencing Edge Router the header of said message packet by affixing said Label Sequence to said header; and

forwarding by said Label Sequencing Edge Router said message packet with modified header into the MPLS tunnels denoted by said Label Sequence.

17. An article of manufacture as claimed in claim 16 wherein

said Label Sequence comprises a plurality of MPLS shim headers and

wherein each MPLS shim header contains a label identifying a respective tunnel of said intervening MPLS domains.

18. An article of manufacture as claimed in claim 17 wherein

said MPLS shim headers are inserted in an order with respect to the sequence of said intervening MPLS domains along the packet route defined by said Label Sequence.

19. An article of manufacture as claimed in claim 18 wherein

said order is a reverse order with respect to the sequence of said intervening MPLS domains along the packet route defined by said Label Sequence such that the outer label closest to the MAC header identifies a tunnel in the first MPLS domain to be traversed, and such that the innermost label closest to the IP header identifies a tunnel in the last MPLS domain to be traversed.