Improved MPLS-TE LSP Path Computation using Preemption

In multi-protocol label switching-traffic engineering (MPLS-TE) networks with distributed tunnel path computation on head-end routers, tunnel requests are handled one by one, in an uncoordinated manner without any knowledge of future and other requests. The order in which requests are handled has a significant impact on the network optimization and blocking probability. If it is not possible to control the arrival order, in return it is possible, in some cases, to reorder requests using the preemption function. This paper evaluates the impact of the arrival order, so as to determine efficient orders. It then proposes two preemption strategies so as to reorder arrivals and evaluate these strategies applied to the shortest constrained path computation algorithm.

[1]  Tony Li,et al.  IS-IS Extensions for Traffic Engineering , 2008, RFC.

[2]  Jean-Louis Le Roux,et al.  Generic architecture for MPLS-TE routing , 2006 .

[3]  Bijan Jabbari,et al.  Internet traffic engineering using multi-protocol label switching (MPLS) , 2002, Comput. Networks.

[4]  Subhash Suri,et al.  Profile-Based Routing: A New Framework for MPLS Traffic Engineering , 2001, QofIS.

[5]  Murali S. Kodialam,et al.  Minimum interference routing with applications to MPLS traffic engineering , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[7]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[8]  Vijay Srinivasan,et al.  RSVP-TE: Extensions to RSVP for LSP Tunnels , 2001, RFC.

[9]  Ian F. Akyildiz,et al.  A new preemption policy for DiffServ-aware traffic engineering to minimize rerouting , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[10]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[11]  Raouf Boutaba,et al.  Dynamic Online Routing Algorithm for MPLS Traffic Engineering , 2002, NETWORKING.

[12]  Dave Katz,et al.  Traffic Engineering (TE) Extensions to OSPF Version 2 , 2003, RFC.

[13]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.