Disjoint Multi-Path Routing and Failure Recovery

Applications such as Voice over IP and video delivery require continuous network service, requiring fast failure recovery mechanisms. Proactive Fast failure recovery mechanisms have been recently proposed to improve network performance during the failure transients. The proposed mechanisms need extra infrastructural support in the form of routing table entries, extra addresses etc. In this paper, we study if the extra infrastructure support can be exploited to build disjoint paths in those frameworks, while keeping the recovery path lengths close to the primary paths. Our evaluations show that it is possible to extend the proactive recovery mechanisms to provide support for nearly- disjoint paths.

[1]  Wayne D. Grover,et al.  IP layer restoration and network planning based on virtual protection cycles , 2000, IEEE Journal on Selected Areas in Communications.

[2]  G. Apostolopoulos.  Using Multiple Topologies for IP-only Protection Against Network Failures : A Routing Performance Perspective , 2006 .

[3]  Marwan Krunz,et al.  Disjoint multipath routing using colored trees , 2007, Comput. Networks.

[4]  Amund Kvalbein,et al.  Fast Recovery from Dual Link Failures in IP Networks , 2009, IEEE INFOCOM 2009.

[5]  Thomas Magedanz,et al.  Two routing algorithms for failure protection in IP networks , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[6]  Kai-Yeung Siu,et al.  Local restoration algorithm for link-state routing protocols , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[7]  Anees Shaikh,et al.  Improving service differentiation in IP networks through dual topology routing , 2007, CoNEXT '07.

[8]  Santosh S. Vempala,et al.  Path splicing , 2008, SIGCOMM '08.

[9]  G. Jayavelu,et al.  Maintaining Colored Trees for Disjoint Multipath Routing Under Node Failures , 2009, IEEE/ACM Transactions on Networking.

[10]  Stein Gjessing,et al.  Fast IP Network Recovery Using Multiple Routing Configurations , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[11]  Stein Gjessing,et al.  Post-Failure Routing Performance with Multiple Routing Configurations , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[12]  Chen-Nee Chuah,et al.  Proactive vs reactive approaches to failure resilient routing , 2004, IEEE INFOCOM 2004.

[13]  Chen-Nee Chuah,et al.  Failure Inferencing Based Fast Rerouting for Handling Transient Link and Node Failures , 2005, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[14]  Stewart Bryant,et al.  A Framework for Loop-Free Convergence , 2010, RFC.

[15]  John A. Copeland,et al.  Hamiltonian cycle protection: a novel approach to mesh WDM optical network protection , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[16]  Santosh S. Vempala,et al.  Path Splicing: Reliable Connectivity with Rapid Recovery , 2007, HotNets.

[17]  Muriel Médard,et al.  Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs , 1999, TNET.

[18]  T. Schwabe,et al.  Resilient routing using MPLS and ECMP , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[19]  Michael Menth,et al.  Relaxed multiple routing configurations for IP fast reroute , 2008, NOMS 2008 - 2008 IEEE Network Operations and Management Symposium.

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

[21]  Chen-Nee Chuah,et al.  Analysis of link failures in an IP backbone , 2002, IMW '02.

[22]  Stewart Bryant,et al.  IP Fast Reroute Using Not-via Addresses , 2006 .

[23]  Peter Psenak.  MT-OSPF: Multi Topology (MT) Routing in OSPF , 2004 .

[24]  Wayne D. Grover,et al.  Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[25]  Olivier Bonaventure,et al.  An evaluation of IP-based fast reroute techniques , 2005, CoNEXT '05.

[26]  Nicole Immorlica,et al.  Cycle Cover with Short Cycles , 2005, STACS.