This paper presents a new mechanism, called BGP with root cause notification (BGP-RCN), that provides an upper bound of O(d) on routing convergence delay for BGP, where d is the network diameter as measured by the number of AS hops. BGP-RCN lets each routing update message carry the information about the specific cause which triggered the update message. Once a node v receives the first update message triggered by a link failure, v can avoid using any paths that have been obsoleted by the same failure. The basic approach in BGP-RCN is applicable to path vector routing protocols in general. Our analysis and simulation show that BGP-RCN can achieve substantial reduction in both BGP convergence time and the total number of intermediate route changes. Ó 2004 Elsevier B.V. All rights reserved.
|
351
|
Ad hoc On-Demand Distance Vector (AODV) Routing
– Perkins, Belding-Royer, et al.
- 2003
|
|
233
|
Delayed Internet routing convergence
– Labovitz, Ahuja, et al.
|
|
152
|
Network layer protocols with byzantine robustness
– PERLMAN
- 1988
|
|
131
|
Secure bor-der gateway protocol (S-BGP) - real world performance and deployment issues
– Kent, Lynn, et al.
- 2000
|
|
112
|
The impact of internet policy and topology on delayed routing convergence
– Labovitz, Ahuja, et al.
- 2001
|
|
96
|
The stable paths problem and interdomain routing
– Griffin, Shepherd, et al.
- 2002
|
|
93
|
Route flap damping exacerbates Internet routing convergence
– Mao, Govindan, et al.
- 2002
|
|
76
|
An experimental analysis of BGP convergence time
– Griffin, Premore
- 2001
|
|
67
|
Garcia-Luna-Aceves, “Securing the border gateway routing protocol
– Smith, J
- 1996
|
|
65
|
A loop-free extended bellman-ford routing protocol without bouncing effect
– Cheng, Riley, et al.
- 1989
|
|
64
|
A safe path vector protocol
– Griffin, Willfong
- 2000
|
|
62
|
Securing distance-vector routing protocols
– Smith, Murthy, et al.
- 1997
|
|
37
|
Improved BGP convergence via Ghost Flushing
– Bremler-Barr, Afek, et al.
- 2003
|
|
32
|
BGP-RCN: Improving BGP Convergence Through Root Cause Notification
– Pei, Azuma, et al.
- 2003
|
|
22
|
Real-time model and convergence time of BGP
– Obradovic
|
|
14
|
Limiting Path Exploration in Path Vector Protocols
– Chandrashekar, Duan, et al.
- 2004
|
|
14
|
An Approach To Accelerate Convergence for Path Vector Protocol
– Lou, Xie, et al.
- 2002
|
|
8
|
Improving BGP Convergence Through Assertions Approach
– Pei, Zhao, et al.
- 2002
|
|
8
|
A Study of Packet Delivery Performance during Routing Convergence
– Pei, Wang, et al.
- 2003
|
|
6
|
An Analysis BGP Multiple Origin AS(MOAS) Conflicts
– Zhao, Pei, et al.
- 2001
|
|
2
|
Ssf.os.trace—a record route mechanism for ssfnet ip, v 0.1, http://www.cs.dartmouth.edu/mili/research/ ssf/trace/Trace.html
– Liljenstam
|
|
2
|
Modeling inter-domain routing protocol dynamic, Avaiable from outreach/isma/0012/talks/labovitz
– Labovitz, Ahuja
- 2000
|
|
1
|
Border Gateway Protocol 4, Rfc 1771, SRI Network Information
– Rekhter, Li
- 1995
|
|
1
|
Border Gateway Protocol 4, Available from
– Rekhter, Li, et al.
- 2003
|
|
1
|
Multi-as topologies from bgp routing tables, Available from asgraph/index.html
– Premore
|
|
1
|
BGP Table Data, Available from bgp.potaroo.net
– Huston
|
|
1
|
Slow internet routing convergence, Available from December 2002. Dan Pei is currently a Ph.D candidate at UCLA Computer Science Department. His current research interests include the fault tolerance and performance of Internet Routing Protocols. He receiv
– Wattenhofer
- 1995
|
