skip to main content
10.1145/347059.347428acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free access

Delayed Internet routing convergence

Published: 28 August 2000 Publication History

Abstract

This paper examines the latency in Internet path failure, failover and repair due to the convergence properties of inter-domain routing. Unlike switches in the public telephony network which exhibit failover on the order of milliseconds, our experimental measurements show that inter-domain routers in the packet switched Internet may take tens of minutes to reach a consistent view of the network topology after a fault. These delays stem from temporary routing table oscillations formed during the operation of the BGP path selection process on Internet backbone routers. During these periods of delayed convergence, we show that end-to-end Internet paths will experience intermittent loss of connectivity, as well as increased packet loss and latency. We present a two-year study of Internet routing convergence through the experimental instrumentation of key portions of the Internet infrastructure, including both passive data collection and fault-injection machines at major Internet exchange points. Based on data from the injection and measurement of several hundred thousand inter-domain routing faults, we describe several unexpected properties of convergence and show that the measured upper bound on Internet inter-domain routing convergence delay is an order of magnitude slower than previously thought. Our analysis also shows that the upper theoretic computational bound on the number of router states and control messages exchanged during the process of BGP convergence is factorial with respect to the number of autonomous systems in the Internet. Finally, we demonstrate that much of the observed convergence delay stems from specific router vendor implementation decisions and ambiguity in the BGP specification.

References

[1]
Internet Peformance Measurement and Analysis Project (IPMA). http://www.merit.edu/ipma.]]
[2]
Multithreaded Routing Toolkit (MRT) Project. http://www.mrtd.net.]]
[3]
North American Network Operators Group (NANOG). http://www.nanog.org.]]
[4]
K. Bhargavan, D. Obradovic, and C. Gunter. Formal Verification of Distance Vector Routing Protocols. International Conference on Theorem Proving and Higher Order Logics, Aug. 2000.]]
[5]
C. Cheng, R. Riley, S. Kumar, and J. G. Aceves. A Loop-Free Extended Bellman-Ford Routing Protocol Without Bouncing Effect. Proc. of the ACM SIGCOMM, pages 224-236, Aug. 1989.]]
[6]
L. Gao and J. Rexford. Stable Internet Routing Without Global Coordination. Proc. of ACM SIGMETRICS, June 2000.]]
[7]
J. Garcia-Luna-Aceves. Loop-free Routing Using Diffusing Computations. IEEE/ACM Transactions on Networking, Feb. 1993.]]
[8]
T. Griffn and G. Wilfong. An Analysis of BGP Convergence Properties. Proceedings of the ACM SIGCOMM, Aug. 1999.]]
[9]
T. Griffn and G. Wilfong. A Safe Path Vector Protocol. Proc. of IEEE Infocom, Mar. 2000.]]
[10]
B. Halabi. Internet Routing Architecture. Cisco Press, 1997.]]
[11]
D. Hampton, H. Salama, and D. Shah. The IP Telephony Border Gateway Protocol (TBGP), June 1999. draft-ietf-iptel-glp-tbgp-01.txt.]]
[12]
J. Hawkinson. Cisco Routing FAQ. http://www.faqs.org/faqs/cisco-networking-faq.]]
[13]
M. Kaat. Overview of 1999 IAB Network Layer Workshop, Nov. 1999. http://www.ietf.org/internetdrafts/draft-ietf-iab-ntwlyrws-over-01.txt.]]
[14]
C. Labovitz. Scalability of the Internet Backbone Routing Infrastructure. PhD thesis, University of Michigan, Aug. 1999.]]
[15]
C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian. A Study of Delayed BGP Convergence. Technical Report MSR-TR-2000-08, Microsoft Research, Feb. 2000.]]
[16]
C. Labovitz, A. Ahuja, and F. Jahanian. Experimental Study of Internet Stability and Wide-area Network Failures. Proc. International Symposium on Fault-Tolerant Computing, June 1999.]]
[17]
C. Labovitz, G. Malan, and F. Jahanian. Internet Routing Instability. IEEE/ACM Transactions on Networking, Aug. 1997.]]
[18]
C. Labovitz, G. Malan, and F. Jahanian. Origins of Pathological Internet Routing Instability. Proc. of the IEEE INFOCOM, Mar. 1999.]]
[19]
V. Paxson. End-to-End Internet Packet Dynamics. Proc. of the ACM SIGCOMM, 1997.]]
[20]
R. Perlman. Interconnections, Second Edition. Addison-Wesley, Reading Massachusetts, 1999.]]
[21]
Y. Rekhter and T. Li. A Border Gateway Protocol 4 (BGP4), Sept. 1999. draft-ietf-idr-bgp4-09.txt.]]
[22]
F. Schneider, S. Bellovin, and A. Inouye. Building Trustworthy Systems: Lessons from the PTN and Internet. Internet Computing, pages 64-72, Nov. 1999.]]
[23]
K. Varadhan, R. Govindan, and D. Estrin. Persistent Route Oscillations in Inter-Domain Routing. Technical Report USC CS TR 96-631, Department of Computer Science, University of Southern California, Feb. 1996.]]
[24]
W. Zaumen and J. J. G.-L. Aceves. Dynamics of Distributed Shortest-Path Routing Algorithms. Proc. of the ACM SIGCOMM, Aug. 1991.]]

Cited By

View all
  • (2024)An Empirical Characterization of Anycast Convergence TimeProceedings of the 2024 Applied Networking Research Workshop10.1145/3673422.3674890(23-30)Online publication date: 23-Jul-2024
  • (2022)The best of both worldsProceedings of the 22nd ACM Internet Measurement Conference10.1145/3517745.3561421(655-663)Online publication date: 25-Oct-2022
  • (2022)G-SINC: Global Synchronization Infrastructure for Network Clocks2022 41st International Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS55811.2022.00021(133-145)Online publication date: Sep-2022
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGCOMM '00: Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
August 2000
348 pages
ISBN:1581132239
DOI:10.1145/347059
  • cover image ACM SIGCOMM Computer Communication Review
    ACM SIGCOMM Computer Communication Review  Volume 30, Issue 4
    October 2000
    319 pages
    ISSN:0146-4833
    DOI:10.1145/347057
    Issue’s Table of Contents
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 August 2000

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

SIGCOMM00
Sponsor:
SIGCOMM00: ACM SIGCOMM 2000
August 28 - September 1, 2000
Stockholm, Sweden

Acceptance Rates

SIGCOMM '00 Paper Acceptance Rate 26 of 238 submissions, 11%;
Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)243
  • Downloads (Last 6 weeks)33
Reflects downloads up to 28 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)An Empirical Characterization of Anycast Convergence TimeProceedings of the 2024 Applied Networking Research Workshop10.1145/3673422.3674890(23-30)Online publication date: 23-Jul-2024
  • (2022)The best of both worldsProceedings of the 22nd ACM Internet Measurement Conference10.1145/3517745.3561421(655-663)Online publication date: 25-Oct-2022
  • (2022)G-SINC: Global Synchronization Infrastructure for Network Clocks2022 41st International Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS55811.2022.00021(133-145)Online publication date: Sep-2022
  • (2022)Eliminating Routing Loops and Oscillations in BGP Using Total Ordering2022 IEEE 47th Conference on Local Computer Networks (LCN)10.1109/LCN53696.2022.9843706(9-17)Online publication date: 26-Sep-2022
  • (2022)Stable, Loop-Free, Multi-Path Inter-Domain Routing Using BGPICC 2022 - IEEE International Conference on Communications10.1109/ICC45855.2022.9839159(322-328)Online publication date: 16-May-2022
  • (2021)A Survey of Fast-Recovery Mechanisms in Packet-Switched NetworksIEEE Communications Surveys & Tutorials10.1109/COMST.2021.306398023:2(1253-1301)Online publication date: Oct-2022
  • (2019)BlinkProceedings of the 16th USENIX Conference on Networked Systems Design and Implementation10.5555/3323234.3323248(161-176)Online publication date: 26-Feb-2019
  • (2019)Optimized MRAI Timers for Border Gateway Protocol in Large NetworksInternational Journal of Distributed Systems and Technologies10.4018/IJDST.201910010310:4(31-44)Online publication date: 1-Oct-2019
  • (2019)Residential links under the weatherProceedings of the ACM Special Interest Group on Data Communication10.1145/3341302.3342084(145-158)Online publication date: 19-Aug-2019
  • (2019)SDN-Based Privacy Preserving Cross Domain RoutingIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2018.281180716:6(930-943)Online publication date: 1-Nov-2019
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media