Self-configuring loop-free alternates with high link failure coverage

A change in network topology triggers the re-convergence process of routing protocols. The re-convergence time of current routing protocols (e.g. OSPF) is constrained by the possibility of having transient loops due to the independent calculation of shortest paths between routers affected by a network failure. Several IP Fast-ReRoute (IPFRR) schemes have been developed to pro-actively calculate and install alternate forwarding entries almost instantaneously once a topology update message is received, without causing temporary micro-loops. The IPFRR scheme which has been used most extensively so far makes use of Loop-Free Alternates (LFA). While these are easy to configure, LFAs still require manual configuration, and the resulting ratio of covered link failures is only about 60 to 70 percent. This paper presents a logical extension of the Loop-Free Alternate concept, proposes a self-configuring scheme to populate the corresponding alternate entries, and evaluates the performance of the scheme with respect to coverage, configuration time and path length in a simulation environment.

[1]  Mikael Johansson,et al.  Robust load balancing under traffic uncertainty—tractable models and efficient algorithms , 2011, Telecommun. Syst..

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

[3]  Michael Menth,et al.  Comparison of IP-based and explicit paths for one-to-one fast reroute in MPLS networks , 2013, Telecommun. Syst..

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

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

[6]  Gilbert Moïsio,et al.  Internet Engineering Task Force , 2014 .

[7]  Aubin Jarry Fast reroute paths algorithms , 2013, Telecommun. Syst..

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

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

[10]  Stewart Bryant,et al.  IP Fast Reroute Framework , 2010, RFC.

[11]  Vijay Srinivasan,et al.  RSVP-TE: Extensions to RSVP for LSP Tunnels , 2001, RFC.

[12]  Lixia Zhang,et al.  Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification , 1997, RFC.

[13]  Pierre Francois Loop-free convergence using oFIB , 2012 .

[14]  Peter Steenkiste,et al.  Quantifying Internet End-to-End Route Similarity , 2006 .

[15]  Minas Gjoka,et al.  Evaluation of IP Fast Reroute Proposals , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

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

[17]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

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

[19]  S. Gjessing,et al.  Alternative schemes for proactive IP recovery , 2006, 2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06..

[20]  Olivier Bonaventure,et al.  Achieving sub-second IGP convergence in large IP networks , 2005, CCRV.

[21]  Gábor Rétvári,et al.  IP fast ReRoute: Loop Free Alternates revisited , 2011, 2011 Proceedings IEEE INFOCOM.

[22]  Michal Pioro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010 .