Routing, weight assignment and load balancing for tunnel-based fast IP local failure recovery

To alleviate the impact of network component failures, many fast IP local recovery schemes have been proposed to reroute traffic in the event of failure. Tunnel-based fast IP local recovery is one of the most commonly adopted techniques. In IP-in-IP tunneling, when a failure occurs, the nodes adjacent to a failure are activated to encapsulate and reroute the affected traffic to the endpoint along the shortest path. Once the endpoint receives the affected traffic, it décapsulâtes and delivers the packets to original destination along the shortest path. These shortest paths are computed based on link weights. Therefore the design of link weights for tunnel-based fast IP local recovery is a critical issue. The goal of this paper is to determine a set of link weights in a tunnel-based fast IP local recovery system to jointly achieve: (1) load balance in the normal state (i.e., non-failure state) and (2) protection of any single link failure without incurring link overload during the failure recovery. We first formulate this problem as a mixed integer programming (MIP). Due to the NP-hard property of the MIP, a Simulated Annealing based Tunneling (SATu) scheme is proposed to obtain the solution of the MIP. In SATu, only the nodes adjacent to a failure are activated to encapsulate the affected packets and forward them to endpoint without disturbing regular traffic. Numerical results show that the proposed scheme improves tunnel-based IP fast reroute approach to achieve high rate of fault recovery in protecting single link failures without incurring link congestion in the non-failure state.

[1]  Amund Kvalbein,et al.  Fast Recovery From Dual-Link or Single-Node Failures in IP Networks Using Tunneling , 2010, IEEE/ACM Transactions on Networking.

[2]  Michael Menth,et al.  Relaxed multiple routing configurations: IP fast reroute for single and correlated failures , 2009, IEEE Transactions on Network and Service Management.

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

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

[5]  Stein Gjessing,et al.  Multiple routing configurations for fast IP network recovery , 2009, IEEE/ACM Trans. Netw..

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  Mingwei Xu,et al.  A Lightweight IP Fast Reroute Algorithm with Tunneling , 2010, 2010 IEEE International Conference on Communications.

[8]  Christian E. Hopps,et al.  Analysis of an Equal-Cost Multi-Path Algorithm , 2000, RFC.

[9]  Alia Atlas,et al.  U-turn Alternates for IP/LDP Fast-Reroute , 2006 .

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

[11]  H. Jonathan Chao,et al.  IP fast rerouting for single-link/node failure recovery , 2007, 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07).

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

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

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

[15]  Stewart Bryant,et al.  IP Fast Reroute using tunnels , 2007 .

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

[17]  Chen-Nee Chuah,et al.  Fast local rerouting for handling transient link failures , 2007, TNET.

[18]  Srihari Nelakuditi,et al.  Failure insensitive routing for ensuring service availability , 2003, IWQoS'03.

[19]  Chen-Nee Chuah,et al.  Fast Local Rerouting for Handling Transient Link Failures , 2007, IEEE/ACM Transactions on Networking.