Simulated Annealing based weight assignment scheme for Load Balanced fast IP local failure recovery

Network failures often cause service interruptions as well as packet losses. To mitigate the impact of failures, many IP fast local recovery schemes have been proposed to reroute traffic in the event of failure in past literatures. However, the rerouted traffic may cause congestion or overload on pre-computed backup routes if the link capacity on those backup routes is not considered in recovery schemes. In this paper, we propose a Simulated Annealing based Load Balanced (SALB) fast IP local protection scheme to construct backup routing tables for protecting link failures. In the proposed SALB scheme, we jointly consider protection switching time, network survivability, and traffic load distribution. The proposed SALB scheme is capable of mitigating other kinds of failures, such as node failures or SRLG failures. In the proposed scheme, upon a failure, only the nodes adjacent to a failure are activated to divert affected traffic to backup paths. This local reaction process guarantees fast protection switching and reduces failure recovery time. Besides, we formulate this problem as a mixed integer programming problem, in which the working traffic load on the most congested link is to be minimized while protecting link failures. Numerical results delineate that the proposed scheme achieves high survivability and load balancing at the expense of slightly increasing the average path hop count and the entries of backup routing table.

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

[2]  Lei Guo,et al.  Path-based routing provisioning with mixed shared protection in WDM mesh networks , 2006, Journal of Lightwave Technology.

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

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

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

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

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

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

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

[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]  Bin Liu,et al.  Load-Balanced IP Fast Failure Recovery , 2008, IPOM.

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

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