Loop-free traffic engineering with path protection in MPLS VPNs

In this paper we present a new approach for VPN (virtual private network) traffic engineering with path protection in Multiprotocol Label Switching networks carrying QoS and best effort traffic. Our approach eliminates the path cycles, a problem often encountered in link-based traffic engineering methods. It also allows for control of the maximum path length and the size of the label space in each label switch router. We consider off-line computation of the working and backup paths using a link-based approach. Two cases of 1+1 and 1:1 path protection are considered. Numerical results are presented to show the efficacy of the algorithm in calculating link-disjoint and node-disjoint primary and backup paths for the QoS traffic.

[1]  Jeffery L. Kennington,et al.  Fault restoration and spare capacity allocation with QoS constraints for MPLS networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[2]  Dino Farinacci,et al.  MPLS Label Stack Encoding , 2001, RFC.

[3]  Vinay Kumar Desai.  Traffic Engineering in multiprotocol label switching VPNs , 2005 .

[4]  Ram Krishnan,et al.  Multi-Protocol Label Switching (MPLS) Support of Differentiated Services , 2002, RFC.

[5]  Chun Tung Chou.  Traffic engineering for MPLS-based virtual private networks , 2004, Comput. Networks.

[6]  Vishal Sharma,et al.  Framework for Multi-Protocol Label Switching (MPLS)-based Recovery , 2003, RFC.

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

[8]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2005, TNET.

[9]  Changcheng Huang,et al.  Building reliable MPLS networks using a path protection mechanism , 2002, IEEE Commun. Mag..

[10]  Chun Tung Chou.  Traffic engineering for MPLS-based virtual private networks , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[11]  Mort Naraghi-Pour,et al.  Path restoration with QoS and label constraints in MPLS networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[12]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[13]  Yanghee Choi,et al.  A constrained multipath traffic engineering scheme for MPLS networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[14]  David L. Black,et al.  Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers , 1998, RFC.

[15]  Ezhan Karasan,et al.  Robust path design algorithms for traffic engineering with restoration in MPLS networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[16]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[17]  Mikkel Thorup,et al.  Load optimal MPLS routing with N + M labels , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[18]  Dan Grossman,et al.  New Terminology and Clarifications for Diffserv , 2002, RFC.

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

[20]  Tony Li,et al.  Intermediate System to Intermediate System (IS-IS) Extensions for Traffic Engineering (TE) , 2004, RFC.

[21]  Andrew G. Malis,et al.  A Core MPLS IP VPN Architecture , 2000, RFC.

[22]  Debasis Mitra,et al.  A case study of multiservice, multipriority traffic engineering design for data networks , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[23]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.