Constructing disjoint paths for failure recovery and multipath routing

Applications such as Voice over IP and video streaming require continuous network service, requiring fast failure recovery mechanisms. Proactive failure recovery schemes have been recently proposed to improve network performance during the failure transients. These proactive failure recovery schemes 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 lengths of the recovery paths close to those of the primary paths. Our evaluations show that it is possible to extend the proactive failure recovery schemes to provide support for nearly-disjoint paths which can be employed in multipath routing for load balancing and QoS.

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

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

[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]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

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

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

[8]  Peter Steenkiste,et al.  On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.

[9]  B. Bellur,et al.  Quality-of-service routing using maximally disjoint paths , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

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

[11]  D. Towsley,et al.  Combining Multipath Routing and Congestion Control for Robustness , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[12]  Mung Chiang,et al.  DEFT: Distributed Exponentially-Weighted Flow Splitting , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

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

[15]  A. L. Narasimha Reddy,et al.  Disjoint Multi-Path Routing and Failure Recovery , 2010, 2010 IEEE International Conference on Communications.

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

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

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

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

[20]  Abhay Roy,et al.  Multi-Topology (MT) Routing in OSPF , 2007, RFC.

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

[22]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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