Delayed Internet routing convergence

被引:157
作者
Labovitz, C [2 ]
Ahuja, A
Bose, A
Jahanian, F
机构
[1] Microsoft Res, Redmond, WA 98052 USA
[2] Arbor Networks, Ann Arbor, MI 48104 USA
[3] Univ Michigan, Ctr parallel Comp, Ann Arbor, MI 48109 USA
基金
美国国家科学基金会;
关键词
failure analysis; Internet; network reliability; routing;
D O I
10.1109/90.929852
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper examines the latency in Internet path failure, failover, and repair due to the convergence properties of interdomain routing. Unlike circuit-switched paths which exhibit failover on the order of milliseconds, our experimental measurements show that interdomain 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 fluctuations formed during the operation of the Border Gateway Protocol (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 interdomain routing faults, we describe several unexpected properties of convergence and show that the measured upper bound on Internet interdomain 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.
引用
收藏
页码:293 / 306
页数:14
相关论文
共 25 条
[1]  
[Anonymous], INTERNET ROUTING ARC
[2]  
Bertsekas D. P., 1992, DATA NETWORKS
[3]  
BHARGAVAN K, 2000, INT C THEOR PROV HIG, P53
[4]  
CHENG CS, 1989, COMP COMM R, V19, P224, DOI 10.1145/75247.75269
[5]  
Gao LX, 2000, PERF E R SI, V28, P307, DOI 10.1145/345063.339426
[6]   Loop-Free Routing Using Diffusing Computations [J].
Garcia-Lunes-Aceves, J. J. .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1993, 1 (01) :130-141
[7]  
Griffin T. G., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P490, DOI 10.1109/INFCOM.2000.832222
[8]  
Griffin TG, 1999, COMP COMM R, V29, P277, DOI 10.1145/316194.316231
[9]  
HAMPTON D, 1999, IP TELEPHONY BORDER
[10]  
HAWKINSON J, CISCO ROUTING FAQ