MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  A stability-oriented approach to improving BGP convergence (2004) [4 citations — 0 self]

Download:
Download as a PDF | Download as a PS
by Hongwei Zhang, Anish Arora, Zhijun Liu
In IEEE SRDS
http://www.cse.ohio-state.edu/~zhangho/publications/G-BGP.ps
Add To MetaCart

Abstract:

This paper shows that the elimination of fault-agnostic instability, the instability caused by fault-agnostic distributed control, substantially improves BGP convergence speed. To this end, we first classify BGP convergence instability into two categories: fault-agnostic instability and distribution-inherent instability; secondly, we prove the impossibility of eliminating all distribution-inherent instability in distributed routing protocols; thirdly, we design the Grapevine Border Gateway Protocol (G-BGP) to show that all fault-agnostic instability can be eliminated. G-BGP eliminates all fault-agnostic instability under different fault and routing policy scenarios by (i) piggybacking onto BGP UPDATE messages fine-grained information about faults to the nodes affected by the faults, (ii) quickly resolving the uncertainty between link and node failure as well as the uncertainty of whether a node has changed route, and (iii) rejecting obsolete fault information. We have evaluated G-BGP by both analysis and simulation. Analytically, we prove that, by eliminating fault-agnostic instability, G-BGP achieves optimal convergence speed in several scenarios where BGP convergence is severely delayed (e.g., when a node or a link fail-stops), and when the shortest-path-first policy is used, G-BGP asymptotically improves BGP convergence speed except in scenarios where BGP convergence speed is already optimal (e.g., when a node or a link joins). By simulating networks with up to 115 autonomous systems, we observe that G-BGP improves BGP convergence stability and speed by an order of magnitude.

Citations

699 On power-law relationship of the internet topology – FALOUTSOS, FALOUTSOS, et al. - 1999
252 Routing in the Internet – Huitema - 1995
219 Delayed Internet Routing Convergence – Labovitz, Ahuja, et al. - 2000
132 Stable Internet routing without global coordination – Gao, Rexford - 2001
115 The impact of Internet policy and topology on delayed routing convergence – Labovitz, Wattenhofer, et al. - 2001
112 Packet reordering is not pathological network behavior – Bennett, Partridge, et al. - 1999
90 Route flap damping exacerbates Internet routing convergence – Mao, Govindan, et al. - 2002
83 A border gateway protocol 4 (BGP-4 – Rekhter, Li, et al. - 2003
74 The Stable Paths Problem and Interdomain Routing – Griffin, Shepherd, et al. - 2002
71 The Impact of Routing Policy on Internet Paths – Tangmunarunkit, Govindan, et al. - 2001
59 Observation and analysis of BGP behavior under stress – Wang, Zhao, et al. - 2002
54 On the correctness of IBGP configuration – Griffin, Wilfong - 2002
46 BGP route reflection - an alternative to full mesh IBGP – Bates, Chandra, et al.
46 Elements of Network Protocol Design – Gouda - 1998
44 Improving BGP convergence through consistency assertions – Pei, Zhao, et al. - 2002
34 Improved BGP convergence via ghost flushing – Bremler-Barr, Afek, et al. - 2003
30 Guidelines for creation, selection, and registration of an Autononmous – Hawkinson, Bates - 1930
27 BGP-RCN: Improving BGP convergence through root cause notification – Pei, Azuma, et al.
20 Route oscillations in I-BGP with route reflection – Basu, Ong, et al. - 2002
13 An approach to accelerate convergence for path vector protocol – Luo, Xie, et al. - 2002
8 LSRP: Local stabilization in shortest path routing – Arora, Zhang - 2003
5 Autonomous system confederations for BGP – McPherson, Scudder - 2003
5 Limiting path exploration in BGP – Chandrashekar, Duan, et al. - 2005
3 G-BGP: Stable and Fast Convergence of the Border Gateway Protocol – Zhang, Arora, et al. - 2003