A stability-oriented approach to improving BGP convergence

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.

[1]  Deborah Estrin,et al.  The impact of routing policy on Internet paths , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Ratul Mahajan,et al.  Understanding BGP misconfiguration , 2002, SIGCOMM '02.

[3]  Paul Traina.  Autonomous System Confederations for BGP , 1996, RFC.

[4]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[5]  Gordon T. Wilfong,et al.  The stable paths problem and interdomain routing , 2002, TNET.

[6]  C.-H. Luke Ong,et al.  Route oscillations in I-BGP with route reflection , 2002, SIGCOMM '02.

[7]  Ramesh Govindan,et al.  An analysis of Internet inter-domain topology and route stability , 1997, Proceedings of INFOCOM '97.

[8]  Davor Obradovic,et al.  Real-time model and convergence time of BGP , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[9]  Christian Huitema,et al.  An Architecture for Residential Internet Telephony Service , 1999, IEEE Internet Comput..

[10]  Jaideep Chandrashekar,et al.  Limiting path exploration in BGP , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  J.H. Cowie,et al.  Modeling the global Internet , 1999, Comput. Sci. Eng..

[12]  Hongwei Zhang,et al.  LSRP: local stabilization in shortest path routing , 2006, TNET.

[13]  Yehuda Afek,et al.  Improved BGP convergence via ghost flushing , 2004, IEEE J. Sel. Areas Commun..

[14]  Robert Tappan Morris,et al.  Resilient overlay networks , 2001, SOSP.

[15]  Susan Hares,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[16]  Mohamed G. Gouda.  Elements of network protocol design , 1998 .

[17]  Tony Bates,et al.  Guidelines for creation, selection, and registration of an Autonomous System (AS) , 1996, RFC.

[18]  Ramesh Govindan,et al.  Route flap damping exacerbates internet routing convergence , 2002, SIGCOMM 2002.

[19]  FaloutsosMichalis,et al.  On power-law relationships of the Internet topology , 1999 .

[20]  Daniel Massey,et al.  Observation and analysis of BGP behavior under stress , 2002, IMW '02.

[21]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[22]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[23]  Ruibing Hao,et al.  An approach to accelerate convergence for path vector protocol , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[24]  Christian Huitema,et al.  Routing in the Internet , 1995 .

[25]  Roger Wattenhofer,et al.  The impact of Internet policy and topology on delayed routing convergence , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[26]  Craig Partridge,et al.  Packet reordering is not pathological network behavior , 1999, TNET.

[27]  Jennifer Rexford,et al.  Stable internet routing without global coordination , 2001, TNET.

[28]  Daniel Behnen,et al.  Improving BGP Convergence Through Consistency Assertions , 2004 .

[29]  Enke Chen,et al.  BGP Route Reflection - An Alternative to Full Mesh IBGP , 2000, RFC.

[30]  Abhijit Bose,et al.  Delayed Internet routing convergence , 2000, SIGCOMM.

[31]  Timothy G. Griffin,et al.  On the correctness of IBGP configuration , 2002, SIGCOMM.

[32]  Daniel Massey,et al.  BGP-RCN: improving BGP convergence through root cause notification , 2005, Comput. Networks.