Discussion on the combination of Loop-Free Alternates and Maximally Redundant Trees for IP networks Fast Reroute

IP Fast Reroute (IP FRR) is the IETF standard for providing fast reaction to failures in IP and MPLS/LDP networks. In the past decade, several IP FRR proposals have been proposed, and among them Loop-Free Alternates (LFA) is the simplest, but it cannot achieve 100% single failure coverage. In contrast, Maximally Redundant Trees (MRT) can provide 100% single failure coverage and seems a promising scheme. However, MRT has some drawbacks as it can lead to long backup detours and heavy network congestion. In this paper we combine MRT with LFA to merge their advantages and improve the quality of protection. Observations of performance evaluation suggest that with almost same time and resource consumption as MRT, our mechanism can greatly enhance the quality of protection in terms of backup path length and maximum link utilization.

[1]  Alia Atlas,et al.  Algorithms for computing Maximally Redundant Trees for IP/LDP Fast- Reroute , 2013 .

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

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

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

[5]  Gábor Rétvári,et al.  IP Fast ReRoute: Lightweight Not-Via without Additional Addresses , 2009, IEEE INFOCOM 2009.

[6]  Tarik Cicic,et al.  Redundant trees for fast IP recovery , 2007, 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07).

[7]  A. Kuchar.  Achievements of COST 266 Action and further prospects in research of advanced infrastructure for photonic networks , 2004, Proceedings of 2004 6th International Conference on Transparent Optical Networks (IEEE Cat. No.04EX804).

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

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

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

[11]  M. Menth,et al.  Network resilience through multi-topology routing , 2005, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005..

[12]  Chris Bowers,et al.  An Architecture for IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR) , 2016, RFC.

[13]  Gabor Sandor Enyedi,et al.  NOVEL ALGORITHMS FOR IP FAST REROUTE , 2011 .

[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.  A Framework for Loop-Free Convergence , 2010, RFC.

[16]  Chen-Nee Chuah,et al.  Characterization of Failures in an Operational IP Backbone Network , 2008, IEEE/ACM Transactions on Networking.

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

[18]  Clarence Filsfils,et al.  LFA applicability in SP networks , 2012 .

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

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

[21]  Michael Menth,et al.  Loop-free alternates and not-via addresses: A proper combination for IP fast reroute? , 2010, Comput. Networks.

[22]  Gábor Rétvári,et al.  On Finding maximally redundant trees in strictly linear time , 2009, 2009 IEEE Symposium on Computers and Communications.