article

Stability issues in OSPF routing

Authors:

Jon RieckeAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 31, Issue 4

Pages 225 - 236

https://doi.org/10.1145/964723.383077

Published: 27 August 2001 Publication History

Abstract

We study the stability of the OSPF protocol under steady state and perturbed conditions. We look at three indicators of stability, namely, (a) network convergence times, (b) routing load on processors, and (c) the number of route flaps. We study these statistics under three different scenarios: (a) on networks that deploy OSPF with TE extensions, (b) on networks that use subsecond HELLO timers, and (c) on networks that use alternative strategies for refreshing link-state information. Our results are based on a very detailed simulation of a real ISP network with 292 nodes and 765 links.

References

[1]

C. Alaettinoglu, V. Jacobson, and H. Yu. Towards Milli-Second IGP Convergence. Internet Draft draft-alaettinoglu-isisconvergence-00.txt, IETF, November 2000.]]

[2]

C. Alaettinoglu, A. U. Shankar, K. Dussa-Zieger, and I. Matta. Design and Implementation of MaRS: A Routing Testbed. Journal of Internetworking: Research & Experience, 5(1):17-41, 1994.]]

[3]

O. Aoboul-Magd et. al. Constraint-Based LSP Setup us-ing LDP. Internet Draft draft-ietf-mpls-cr-ldp-05.txt, IETF, February 2001.]]

[4]

G. Apostolopoulos, R. Guerin, and S. Kamat. Implementa-tion and Performance Measurements of QoS Routing Exten-sions to OSPF. In Proceedings of Infocom '99, New York, NY, March 1999.]]

[5]

G. Apostolopoulos, R. Guerin, S. Kamat, and S. K. Tripathi. Quality of Service Based Routing: A Performance Perspec-tive. In Proceedings of SIGCOMM '98, pages 29-40, Van-couver, Canada, August-September 1998.]]

Digital Library

[6]

D. O. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, and G. Swallow. RSVP-TE: Extensions to RSVP for LSP Tunnels. Internet Draft draft-ietf-mpls-rsvp-lsp-tunnel-08.txt, IETF, February 2001.]]

Digital Library

[7]

J. Behrens and J. J. Garcia-Luna Aceves. Distributed, Scal-able Routing Based on Link-State Vectors. In Proceedings of SIGCOMM '94, pages 136-147, London, England, August- September 1994.]]

Digital Library

[8]

R. K. Boel. Dynamic Routing in Delay Networks: Ergodicity, Transients and Large Excursions. In Proceedings of the 30th Conference on Decision and Control, Brighton, England, De-cember 1991.]]

[9]

B. Chinoy. Dynamics of Internet Routing Information. In Pro-ceedings of SIGCOMM '93, pages 45-52, San Francisco, CA, September 1993.]]

Digital Library

[10]

S. Floyd and V. Jacobson. The Synchronization of Periodic Routing Messages. In Proceedings of SIGCOMM '93, pages 33-44, San Francisco, CA, September 1993.]]

Digital Library

[11]

B. Fortz and M. Thorup. Internet Traffic Engineering by Opti-mizing OSPF Weights. In Proceedings of IEEE Infocom 2000, Tel Aviv, Israel, March 2000.]]

[12]

F. Hao and E. Zegura. On Scalable QoS Routing: Perfor-mance Evaluation of Topology Aggregation. In Proceedings of IEEE Infocom 2000, Tel Aviv, Israel, March 2000.]]

[13]

D. Katz and D. Yeung. Traffic Engineering Extensions to OSPF. Internet Draft draft-katz-yeung-ospf-traffic-03.txt, IETF, September 2000.]]

[14]

A. Khanna and J. Zinky. The Revised ARPANET Rout-ing Metric. In Proceedings of SIGCOMM '89, pages 45-56, Austin, TX, September 1989.]]

Digital Library

[15]

C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian. Delayed Internet Routing Convergence. In Proceedings of SIGCOMM '00, pages 175-187, Stockholm, Sweden, August-September 2000.]]

Digital Library

[16]

C. Labovitz, A. Ahuja, and F. Jahanian. Experimental Study of Internet Stability and Wide-Area Backbone Failures. In Proceedings of the Twenty-Ninth Annual International Sym-posium on Fault-Tolerant Computing, Madison, WI, June 1999.]]

Digital Library

[17]

The GateDaemon (GateD) Project. Merit GateD Consortium. http://www.gated.org.]]

[18]

J. Moy. OSPF Version 2. RFC 2328, IETF, April 1998.]]

[19]

D. Oran. OSI IS-IS Intra-domain Routing Protocol. RFC 1142, IETF, February 1990.]]

Digital Library

[20]

Y. Rekhter and T. Li. A Border Gateway Protocol 4 (BGP-4). RFC 1771, IETF, March 1995.]]

Digital Library

[21]

E. Rosen, A. Viswanathan, and R. Callon. Multiprotocol La-bel Switching Architecture. RFC 3031, IETF, January 2001.]]

Digital Library

[22]

A. Shaikh, J. Rexford, and K. G. Shin. Evaluating the Over-heads of Source-Directed Quality-of-Service Routing. In Pro-ceedings of the 6th IEEE International Conference on Net-work Protocols, Austin, TX, October 1998.]]

Digital Library

[23]

A. Shaikh, A. Varma, L. Kalampoukas, and R. Dube. Rout-ing Stability in Congested Networks: Experimentation and Analysis. In Proceedings of SIGCOMM '00, pages 163-174, Stockholm, Sweden, August-September 2000.]]

Digital Library

[24]

D. Sidhu, T. Fu, S. Abdallah, and R. Nair. Open Shortest Path First (OSPF) Routing Protocol Simulation. In Proceedings of SIGCOMM '93, pages 53-62, San Francisco, CA, September 1993.]]

Digital Library

[25]

W. T. Zaumen and J. J. Garcia-Luna Aceves. Dynamics of Distributed Shortest-Path Routing Algorithms. In Proceed-ings of SIGCOMM '91, pages 31-42, Zurich, Switzerland, September 1991.]]

Digital Library

[26]

A. Zinin. Guidelines for Efficient LSA Refreshment in OSPF. Internet Draft draft-ietf-ospf-refresh-guide-01.txt, IETF, July 2000.]]

Cited By

Bernárdez GSuárez-Varela JLópez AShi XXiao SCheng XBarlet-Ros PCabellos-Aparicio A(2023)MAGNNETO: A Graph Neural Network-Based Multi-Agent System for Traffic EngineeringIEEE Transactions on Cognitive Communications and Networking10.1109/TCCN.2023.32357199:2(494-506)Online publication date: Apr-2023
https://doi.org/10.1109/TCCN.2023.3235719
Cheng SLiu FZuo ZJiang Y(2023)TFIR: GCN Powered and Reinforcement Learning-based Topo-Free Intelligent Routing2023 5th International Academic Exchange Conference on Science and Technology Innovation (IAECST)10.1109/IAECST60924.2023.10502924(117-121)Online publication date: 8-Dec-2023
https://doi.org/10.1109/IAECST60924.2023.10502924
Rybowski NBonaventure O(2022)Evaluating OSPF Convergence with ns-3 DCEProceedings of the 2022 Workshop on ns-310.1145/3532577.3532597(120-126)Online publication date: 22-Jun-2022
https://dl.acm.org/doi/10.1145/3532577.3532597
Show More Cited By

Index Terms

Stability issues in OSPF routing
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
2. Networks
  1. Network architectures
  2. Network protocols
    1. Network layer protocols
      1. Routing protocols

Recommendations

Stability issues in OSPF routing
SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications

We study the stability of the OSPF protocol under steady state and perturbed conditions. We look at three indicators of stability, namely, (a) network convergence times, (b) routing load on processors, and (c) the number of route flaps. We study these ...
Better Alternatives to OSPF Routing

The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems-the tunable parameters (the weights) are hard to optimize, the chosen paths are not robust under changes in traffic or network state, ...
RFC 8665: OSPF Extensions for Segment Routing

Comments

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 31, Issue 4

Proceedings of the 2001 SIGCOMM conference

October 2001

275 pages

ISSN:0146-4833

DOI:10.1145/964723

Issue’s Table of Contents

SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
August 2001
298 pages
ISBN:1581134118
DOI:10.1145/383059
Chairmen:
Rene Cruz
Unvi. of California, San Diego
,
George Varghese
Unvi. of California, San Diego

Copyright © 2001 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 August 2001

Published in SIGCOMM-CCR Volume 31, Issue 4

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

143
Total Citations
View Citations
2,966
Total Downloads

Downloads (Last 12 months)222
Downloads (Last 6 weeks)20

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bernárdez GSuárez-Varela JLópez AShi XXiao SCheng XBarlet-Ros PCabellos-Aparicio A(2023)MAGNNETO: A Graph Neural Network-Based Multi-Agent System for Traffic EngineeringIEEE Transactions on Cognitive Communications and Networking10.1109/TCCN.2023.32357199:2(494-506)Online publication date: Apr-2023
https://doi.org/10.1109/TCCN.2023.3235719
Cheng SLiu FZuo ZJiang Y(2023)TFIR: GCN Powered and Reinforcement Learning-based Topo-Free Intelligent Routing2023 5th International Academic Exchange Conference on Science and Technology Innovation (IAECST)10.1109/IAECST60924.2023.10502924(117-121)Online publication date: 8-Dec-2023
https://doi.org/10.1109/IAECST60924.2023.10502924
Rybowski NBonaventure O(2022)Evaluating OSPF Convergence with ns-3 DCEProceedings of the 2022 Workshop on ns-310.1145/3532577.3532597(120-126)Online publication date: 22-Jun-2022
https://dl.acm.org/doi/10.1145/3532577.3532597
Zhang YWu QLai ZLi H(2022)Enabling Low-latency-capable Satellite-Ground Topology for Emerging LEO Satellite NetworksIEEE INFOCOM 2022 - IEEE Conference on Computer Communications10.1109/INFOCOM48880.2022.9796886(1329-1338)Online publication date: 2-May-2022
https://dl.acm.org/doi/10.1109/INFOCOM48880.2022.9796886
Bernardez GSuarez-Varela JLopez AWu BXiao SCheng XBarlet-Ros PCabellos-Aparicio A(2021)Is Machine Learning Ready for Traffic Engineering Optimization?2021 IEEE 29th International Conference on Network Protocols (ICNP)10.1109/ICNP52444.2021.9651930(1-11)Online publication date: 1-Nov-2021
https://doi.org/10.1109/ICNP52444.2021.9651930
Hao YXue YLi TJi JMa M(2020)Dynamic Interest Retransmission Interval Method for Congestion Control in NLSRJournal of Physics: Conference Series10.1088/1742-6596/1584/1/0120311584:1(012031)Online publication date: 1-Jul-2020
https://doi.org/10.1088/1742-6596/1584/1/012031
Tseng STang AChoudhury GTse S(2019)Routing Stability in Hybrid Software-Defined NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2019.290019927:2(790-804)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1109/TNET.2019.2900199
Cui YXiao SWang XYang ZYan SZhu CLi XGe N(2018)DiamondIEEE/ACM Transactions on Networking10.1109/TNET.2017.277353926:1(145-160)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1109/TNET.2017.2773539
Nakayama YHisano DKubo TFukada YTerada JOtaka A(2018)TDD-Based Rapid Fault Detection and Recovery for Fronthaul Bridged NetworkIEEE Communications Letters10.1109/LCOMM.2018.279247922:3(498-501)Online publication date: Mar-2018
https://doi.org/10.1109/LCOMM.2018.2792479
Gvozdiev NVissicchio SKarp BHandley M(2017)Low-Latency Routing on Mesh-Like BackbonesProceedings of the 16th ACM Workshop on Hot Topics in Networks10.1145/3152434.3152453(136-142)Online publication date: 30-Nov-2017
https://dl.acm.org/doi/10.1145/3152434.3152453
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents