Abstract
The loss of routing protocol control messages due to network congestion can cause peer failures in routers, leading to routing failures and network instability. We attempt to decrease the network convergence time in response to a node or link failure in a network and study its implications on network stability. We develop an algorithm to dynamically tune OSPF failure threshold based on the network congestion level. The tunable OSPF protocol expedites failure detections as compared to standard OSPF protocol in lightly loaded networks by reducing the failure threshold parameter; whereas the failure threshold is increased during network congestion to sustain stable routing operation and avoid spurious failure decisions due to missed or delayed hello packets. Simulations performed with constant bit-rate (CBR) and FTP data traffic showed that the tunable OSPF protocol facilitated uninterrupted data transfer and resulted in shorter download times as compared to the standard OSPF protocol. Our findings demonstrate the importance of tunable failure threshold to achieve stable and robust network operation.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Iannaccone, G., Chuah, C., Mortier, R., Bhattacharyya, S., Diot, C.: Analysis of link failures in an IP backbone. In: Proceedings of ACM SIGCOMM Internet Measurement Workshop (November 2002)
Moy, J.: OSPF Version 2. RFC 2328 (April 1998)
Cisco Sy stems, OSPF design g uide [online], http://www.cisco.com/warp/public/104/1.html
Alaettinoglu, C., Jacobson, V., Yu, H.: Towards millisecond IGP convergence. NANOG 20 (October 2000) [online], http://www.nanog.org/mtg-0010/ppt/cengiz.pdf
Choudhury, G., Sapozhnikov, V., Ash, G., Maunder, A., Manral, V.: Prioritized treatment of specific OSPF version 2 packets and congestion avoidance. Internet Draft, draft-ietf-ospf-scalability-09.txt (December 2004)
Pu, J., Manning, E., Shoja, G.C.: Routing reliability analysis of partially disjoint paths. In: IEEE Conference on Communications, Computers, and Signal Processing, August 2001, vol. 1, pp. 79–82 (2001)
Narvaez, P., Siu, K., Tzeng, H.: Local restoration algorithm for link-state routing protocols. In: Eight International Conference on Computer Communications and Networks, pp. 352–357 (1999)
Wu, J., Lin, X., Cao, J., Weijia, J.: An extended fault-tolerant link-state routing protocol in the Internet. In: Eighth Internal Conference on Parallel and Distributed Systems, pp. 331–337 (2001)
Villamizar, C.: Convergence and restoration techniques for ISP interior routing [online], http://www.nanog.org/mtg-0206/ppt/curtis.pdf
Goyal, M., Ramakrishnan, K., Feng, W.: Achieving faster failure detection in OSPF networks. In: Proceedings of ICC 2003, May 2003, vol. 1, pp. 296–300 (2003)
Siddiqi, A.: Improving Network Convergence Time and Network Stability of an OSPFRouted IP Network. Master’s Dissertation, Ottawa-Carleton Institute for Electrical and Computer Engineering, Carleton University, Ottawa (2004)
Banks, J., Carson, J., Nelson, B., Nicol, D.: Discrete-event system simulation, pp. 456–467. Prentice Hall, Englewood Cliffs (2000)
Jun, J., Sichitiu, M.: The nominal capacity of wireless mesh networks. IEEE Wireless Communications 10, 8–14 (2003)
Acharya, A., Misra, A.: High-performance architectures for IP-based multihop 802.11 networks. IEEE Wireless Communications 10, 22–28 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Siddiqi, A., Nandy, B. (2005). Improving Network Convergence Time and Network Stability of an OSPF-Routed IP Network. In: Boutaba, R., Almeroth, K., Puigjaner, R., Shen, S., Black, J.P. (eds) NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. NETWORKING 2005. Lecture Notes in Computer Science, vol 3462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422778_38
Download citation
DOI: https://doi.org/10.1007/11422778_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25809-4
Online ISBN: 978-3-540-32017-3
eBook Packages: Computer ScienceComputer Science (R0)