IP fast rerouting for single-link/node failure recovery

Failure recovery in IP networks is critical to high quality service provisioning. The main challenge is how to achieve fast recovery without introducing high complexity and resource usage. Today’s networks mainly use route recalculation and lower layer protection. However, route recalculation could take as long as seconds to complete; while lower layer protection usually requires considerable bandwidth redundancy. We present two fast rerouting algorithms to achieve recovery from single-link and single-node failures, respectively. The idea is to calculated backup paths in advance. When a failure is detected, the affected packets are immediately forwarded through backup paths to shorten the service disruption. This paper answers the following questions: 1. How to find backup paths? 2. How to coordinate routers during the rerouting without explicit signaling? 3. How to realize distributed implementation? The schemes react to failures very fast because there are no calculations on the fly. They are also cost efficient because no bandwidth reservation is required. Our schemes guarantee 100% failure recovery without any assumption on the primary paths. Simulations show that our schemes yield comparable performance to shortest path route recalculation. This work illuminates the possibility of using pure IP layer solutions to build highly survivable yet cost-efficient networks.

[1]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[2]  Alia Atlas,et al.  Basic Specification for IP Fast Reroute: Loop-Free Alternates , 2008, RFC.

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

[4]  Byrav Ramamurthy,et al.  Shared risk link Group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks , 2005, IEEE/ACM Transactions on Networking.

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

[6]  Biswanath Mukherjee,et al.  IP resilience within an autonomous system: current approaches, challenges, and future directions , 2005, IEEE Communications Magazine.

[7]  Chunming Qiao,et al.  Failure protection in layered networks with shared risk link groups , 2004 .

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

[9]  Wu-chi Feng,et al.  Achieving faster failure detection in OSPF networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[10]  Athina Markopoulou,et al.  Characterization of failures in an IP backbone , 2004, IEEE INFOCOM 2004.

[11]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks , 2003 .

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

[13]  P. Baran,et al.  The beginnings of packet switching: some underlying concepts , 2002, IEEE Commun. Mag..

[14]  G. Swallow,et al.  SONET/SDH-like resilience for IP networks: a survey of traffic protection mechanisms , 2004, IEEE Network.

[15]  Chen-Nee Chuah,et al.  Feasibility of IP restoration in a tier 1 backbone , 2004, IEEE Network.

[16]  Charles E. Perkins,et al.  IP Encapsulation within IP , 1996, RFC.

[17]  Kireeti Kompella,et al.  LDP failure detection and recovery , 2004, IEEE Communications Magazine.

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

[19]  Tsong-Ho Wu,et al.  A class of self-healing ring architectures for SONET network applications , 1992, IEEE Trans. Commun..

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

[21]  Randy H. Katz,et al.  On failure detection algorithms in overlay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[22]  Xiaowei Yang,et al.  Source selectable path diversity via routing deflections , 2006, SIGCOMM.