Abstract
Routing loops have recently re-emerged as an important issue in new carrier class Ethernet technologies such as IEEE 802.1aq. While they can waste resources through full link utilization, routing loops were originally mitigated in IP networks by TTL expiration, resulting in wasted resources before packets were dropped after a few seconds. In this paper a new mitigation approach based upon Early Packet Dropping (EPD) is developed, in which a router can drop looping packets earlier than expected if full link utilization will occur before TTL expiration. While the EPD algorithm deals only with loops between two nodes, a proposed solution known as TTL Relaxation is also combined with this loop mitigation mechanism in order to minimize the use of EPD and minimize the performance degradation introduced by loops between more than two nodes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hengartner, U., Moon, S., Mortier, R., Diot, C.: Detection and analysis of routing loops in packet traces. In: Imw 2002: Proceedings of the Second Internet Measurement Workshop, pp. 107–112 326 (November 2002)
Seaman, M.: Exact hop count (December 2006), [Online] http://www.ieee802.org/1/files/public/docs2006/aq-seaman-exact-hop-count-1206-01.pdf
Francois, P., Filsfils, C., Evans, J., Bonaventure, O.: Achieving sub-second IGP convergence in large IP networks. Computer Communication Review 35, 35–44 (2005)
Iannaccone, G., Chuah, C.N., Bhattacharyya, S., Diot, C.: Feasibility of IP restoration in a tier 1 backbone. Ieee Network 18, 13–19 (2004)
Murthy, S., Garcia-Lunes-Aceves, J.J.: A Loop Free Algorithm Based On Predecessor Information. In: Proceedings of IEEE IC- CCN (October 1994)
Garcia-Luna-Aceves, J.J., Murthy, S.: A path-finding algorithm for loop-free routing. IEEE/ACM Transactions on Networking 5, 148–160 (1997)
Bohdanowicz, F., Dickel, H., Steigner, C.: Detection of routing loops. In: Proceedings of the 23rd International Conference on Information Networking. IEEE Press, Chiang Mai (2009)
Francois, P., Bonaventure, O.: Avoiding transient loops during the convergence of link-state routing protocols. IEEE/ACM Transactions on Networking 15, 1280–1292 (2007)
Francois, P., Bonaventure, O., Shand, M., Bryant, S., Previdi, S., Filsfils, C.: Internet Draft: Loop-free convergence using oFIB (March 2010), [Online] http://tools.ietf.org/html/draft-ietf-rtgwg-ordered-fib-03
Fu, J., Sjödin, P., Karlsson, G.: Loop-free updates of forwarding tables. IEEE Transactions on Network and Service Management 5(1) (March 2008)
Gjoka, M., Ram, V., Yang, X.W.: Evaluation of IP fast reroute proposals. In: 2007 2nd International Conference on Communication Systems Software & Middleware, vols. 1 and 2, pp. 686–693 994 (2007)
Nelakuditi, S., Zhong, Z.F., Wang, J.L., Keralapura, R., Chuah, C.N.: Mitigating transient loops through interface-specific forwarding. Computer Networks 52, 593–609 (2008)
Lei, S., Jing, F., Xiaoming, F.: Loop-Free Forwarding Table Updates with Minimal Link Overflow. In: ICC 2009: IEEE International Conference on Communications, pp. 1–6 (2009)
Ito, H., Iwama, K., Okabe, Y., Yoshihiro, T.: Avoiding routing loops on the Internet. Theory of Computing Systems 36, 597–609 (2003)
Francois, P., Shand, M., Bonaventure, O.: Disruption free topology reconfiguration in OSPF networks. In: Infocom 2007, vol. 1-5, pp. 89–97 (2007)
Shand, M., Bryant, S.: RFC 5715: A Framework for Loop-Free Convergence (January 2010), [Online] http://www.ietf.org/rfc/rfc5715.txt
Moy, J.: RFC 2328: OSPF version 2. (April 1998), [Online] http://www.ietf.org/rfc/rfc2328.txt
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yousef, M., Hunter, D.K. (2011). Mitigation of Transient Loops in IGP Networks. In: Al-Majeed, S.S., Hu, CL., Nagamalai, D. (eds) Advances in Wireless, Mobile Networks and Applications. ICCSEA WiMoA 2011 2011. Communications in Computer and Information Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21153-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-21153-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21152-2
Online ISBN: 978-3-642-21153-9
eBook Packages: Computer ScienceComputer Science (R0)