DocumentCode
1944119
Title
IP fast ReRoute: Loop Free Alternates revisited
Author
Rétvári, Gábor ; Tapolcai, János ; Enyedi, Gábor ; Császár, András
Author_Institution
Dept. of Telecommun. & Media Inf., Budapest Univ. of Technol. & Econ., Budapest, Hungary
fYear
2011
fDate
10-15 April 2011
Firstpage
2948
Lastpage
2956
Abstract
IP Fast ReRoute (IPFRR) is the IETF standard for providing fast failure protection in IP and MPLS/LDP networks and Loop Free Alternates (LFA) is a basic specification for implementing it. Even though LFA is simple and unobtrusive, it has a significant drawback: it does not guarantee protection for all possible failure cases. Consequently, many IPFRR proposals have appeared lately, promising full failure coverage at the price of added complexity and non-trivial modifications to IP hardware and software. Meanwhile, LFA remains the only commercially available, and therefore, the only deployable IPFRR solution. Deployment, however, crucially depends on the extent to which LFA can protect failures in operational networks. In this paper, therefore, we revisit LFA in order to give theoretical insights and practical hints to LFA failure coverage analysis. First, we identify the topological properties a network must possess to profit from good failure coverage. Then, we study how coverage varies as new links are added to a network, we show how to do this optimally and, through extensive simulations, we arrive to the conclusion that cleverly adding just a couple of new links can improve the quality of LFA protection drastically.
Keywords
IP networks; telecommunication network routing; IP fast reroute; IP hardware; IP software; IPFRR solution; LFA; MPLS/LDP networks; fast failure protection; loop free alternates; Approximation algorithms; Complexity theory; IP networks; Network topology; Proposals; Routing; Topology; IP Fast ReRoute; IP protection; Loop Free Alternates;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM, 2011 Proceedings IEEE
Conference_Location
Shanghai
ISSN
0743-166X
Print_ISBN
978-1-4244-9919-9
Type
conf
DOI
10.1109/INFCOM.2011.5935135
Filename
5935135
Link To Document