Abstract
Although providing reliable network services is getting more and more important, currently used methods in IP networks are typically reactive and error correcting can take a long time. One of the most interesting solutions is interface based fast rerouting, where not only the destination address but also the incoming interface is taken into account during the forwarding. Unfortunately, current methods can not handle all the possible situations as they are prone to form loops and make parts of the network with no failure unavailable. In this paper we propose a new interface based routing method, which always avoids loops for the price of a bit longer paths. We also present extensive simulation results to compare current and proposed algorithms.
Chapter PDF
Similar content being viewed by others
References
Thaler, D.: Multipath issues in unicast and multicast next-hop selection. Internet Engineering Task Force: RFC 2991 (November 2000)
Atlas, A.: Loop-free alternates for ip/ldp local protection. Internet Draft (March 2005), available online: http://tools.ietf.org/html/draft-ietf-rtgwg-ipfrr-spec-base-00
Bryant, S., Filsfils, C., Previdi, S., Shand, M.: Ip fast-reroute using tunnels. Internet Draft (April 2005), available online: http://tools.ietf.org/html/draft-bryant-ipfrr-tunnels-02
Bryant, S., Shand, M., Previdi, S.: Ip fast reroute using not-via addresses. Internet Draft (December 2006), available online: http://www.ietf.org/internet-drafts/draft-ietf-rtgwg-ipfrr-notvia-addresses-00.txt
Nelakuditi, S., Lee, S., Yu, Y., Zhang, Z.-L., Chuah, C-N.: Fast local rerouting for handling transient link failures. Accepted for publication in IEEE/ACM Transactions on Networking (December 2006), available online: http://arena.cse.sc.edu/papers/fir.ton.pdf
Edmonds, J.: Edge-disjoint branchings. Combinatorial Algorithms, 91–96 (1973)
Tarjan, R.E.: Edge-disjoint spanning trees and depth-first search. lnf. Proc. Letters 3(2), 51–53 (1974)
Lovász, L.: On two minimax theorems in graph theory. Journal of Combinatorial Theory, 96–103 (1976)
Chinoy, B., Braun, H.W.: The national science foundation network. Tech. Rep., CAIDA (September 1992), available online: http://www.caida.org/outreach/papers/1992/nsfn/nsfnet-t1-technology.pdf
Garcia-Osma, M.L.: TID scenarios for advanced resilience. Tech. Rep., The NOBEL Project, Work Package 2, Activity A.2.1 (September 2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Enyedi, G., Rétvári, G., Cinkler, T. (2007). A Novel Loop-Free IP Fast Reroute Algorithm. In: Pras, A., van Sinderen, M. (eds) Dependable and Adaptable Networks and Services. EUNICE 2007. Lecture Notes in Computer Science, vol 4606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73530-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-73530-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73529-8
Online ISBN: 978-3-540-73530-4
eBook Packages: Computer ScienceComputer Science (R0)