Fast reroute with pre-established bypass tunnel in MPLS

Internet IP networks utilize multiple-protocol label switching (MPLS), which provides a reliable label switched path (LSP). LSP in MPLS domains needs one label at each Ingress label switching router (LSR) to forward the packet. This study presents a novel method to facilitate restoration of LSP in the MPLS network. The proposed method attempts to establish all possible bypass tunnels based on the available bandwidth between two LSRs around the protected label switched router. The Max-Flow Min-Cut theorem is adopted to find the necessary links through which all paths between LSR"i and LSR"j must pass. All LSPs affected by a LSR failure or a link failure can specify a bypass tunnel that fits its QoS constraints to reroute if there is one. This study also compares the pre-established bypass tunnel (PBT) algorithm and the PBT algorithm with disjoint bypass tunnels (PBT-D). The simulation results indicate that the proposed method has less packet losses in rerouting and can allow more affected LSPs to reroute traffic than RSVP and efficient Pre-Qualify. Additionally, the PBT performs better than PBT-D in terms of correctly receiving ratio and successfully rerouting ratio although PBT-D has the advantages of establishing less paths and fast search time.

[1]  Radim Bartos,et al.  A heuristic approach to service restoration in MPLS networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[2]  Teresa Gomes,et al.  Survey of Recovery Schemes in MPLS Networks , 2006, 2006 International Conference on Dependability of Computer Systems.

[3]  G. Liu,et al.  Performance Evaluation of K Shortest Path Algorithms in MPLS Traffic Engineering , 2004 .

[4]  H. Matsuura,et al.  A Hierarchically Distributed Network Management System for Multi-Layered IP/Photonic GMPLS Networks , 2004 .

[5]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[6]  Murali S. Kodialam,et al.  Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  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.

[8]  Hyunseok Lee,et al.  An efficient recovery mechanism for MPLS-based protection LSP , 2001, Joint 4th IEEE International Conference on ATM(ICATM'01) and High Speed Intelligent Internet Symposium. ICATM 2001 (Cat. No.00EX486).

[9]  Jordi Domingo-Pascual,et al.  Fast rerouting mechanism for a protected label switched path , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

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

[11]  Pallapa Venkataram,et al.  A method of designing a path restoration scheme for MPLS based network , 2002, 5th IEEE International Conference on High Speed Networks and Multimedia Communication (Cat. No.02EX612).

[12]  H. T. Mouftah,et al.  Capacity-balanced alternate routing for MPLS traffic engineering , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[13]  Dan Keun Sung,et al.  A distributed LSP scheme to reduce spare bandwidth demand in MPLS networks , 2006, IEEE Transactions on Communications.

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

[15]  Alia Atlas,et al.  Fast Reroute Extensions to RSVP-TE for LSP Tunnels , 2005, RFC.

[16]  San-qi Li,et al.  Minimum congestion traffic engineering with multi-resource constraint , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[17]  Woojik Chun,et al.  Design and implementation of MPLS network simulator (MNS) supporting QoS , 2001, Proceedings 15th International Conference on Information Networking.

[18]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

[20]  F. Le Faucheur.  IETF Multiprotocol Label Switching (MPLS) Architecture , 1998 .

[21]  Koushik Kar,et al.  Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications , 2000, IEEE Journal on Selected Areas in Communications.

[22]  Subhash Suri,et al.  Routing bandwidth-guaranteed paths with restoration in label-switched networks , 2004, Comput. Networks.

[23]  Randeep Bhatia,et al.  Simple pre-provisioning scheme to enable fast restoration , 2007, TNET.

[24]  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).

[25]  G. Ahn,et al.  Simulator for MPLS path restoration and performance evaluation , 2001, Joint 4th IEEE International Conference on ATM(ICATM'01) and High Speed Intelligent Internet Symposium. ICATM 2001 (Cat. No.00EX486).

[26]  Jordi Domingo-Pascual,et al.  Reliable and fast rerouting mechanism for a protected label switched path , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[27]  George Pavlou,et al.  Improving survivability through traffic engineering in MPLS networks , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[28]  Young-Tak Kim,et al.  Packet lossless fast rerouting scheme with minimized buffer delay , 2004, 2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507).