DocumentCode :
1763046
Title :
Full Protection Made Easy: The DisPath IP Fast Reroute Scheme
Author :
Antonakopoulos, Spyridon ; Bejerano, Yigal ; Koppol, Pramod
Author_Institution :
Google, Zurich, Switzerland
Volume :
23
Issue :
4
fYear :
2015
fDate :
Aug. 2015
Firstpage :
1229
Lastpage :
1242
Abstract :
A major concern in IP networks is to ensure that any topology changes, whether planned or unplanned, do not disrupt network performance. IP Fast Reroute (IP FRR) is a general approach to address this issue by promptly forwarding an IP packet to a predetermined alternate next-hop as soon as the primary next-hop to the destination becomes unavailable. Among the numerous IP FRR schemes proposed to date, the simplest ones do not guarantee protection against every component failure, while more sophisticated ones tend to be difficult to implement due to various inherent complexities, such as nontrivial modifications of IP packets or high resource requirements. This paper presents a simple and efficient IP FRR scheme called DisPath, which leverages several fundamental properties of minimum-cost node-disjoint paths for determining the alternate next-hop toward a given destination. We show that DisPath ensures full coverage, meaning protection against all single link or node failures, with low computational overhead and without the practical complications encountered by other schemes that offer the same level of protection. Our simulations on several realistic instances reveal that DisPath usually creates shorter (and, at worst, not much longer) alternative paths than existing solutions adopted by the industry. Combined with the aforementioned protection guarantee and simplicity of implementation, these results provide strong evidence that DisPath is a most compelling choice of IP FRR scheme.
Keywords :
IP networks; computer network reliability; telecommunication network topology; DisPath IP fast reroute scheme; IP FRR scheme; IP network topology; IP packet forwarding; Internet protocol network; component failure protection; link failure; low computational overhead; node failure; Convergence; IEEE transactions; IP networks; Multiprotocol label switching; Network topology; Routing; Topology; Disjoint paths; U-turn; fast reroute; loop-free alternate (LFA);
fLanguage :
English
Journal_Title :
Networking, IEEE/ACM Transactions on
Publisher :
ieee
ISSN :
1063-6692
Type :
jour
DOI :
10.1109/TNET.2014.2369855
Filename :
6990641
Link To Document :
بازگشت