On the convergence condition and convergence time of BGP

Authors:
Huaming Guo;Wei Su;Hongke Zhang;Sy-Yen Kuo
Affiliations:
National Engineering Lab for Next Generation Internet Interconnection Devices, School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China;National Engineering Lab for Next Generation Internet Interconnection Devices, School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China;National Engineering Lab for Next Generation Internet Interconnection Devices, School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China;Department of Electrical Engineering, National Taiwan University, Taipei 106, Taiwan
Venue:
Computer Communications
Year:
2011

Citing 11
Cited 0

Delayed Internet routing convergence

IEEE/ACM Transactions on Networking (TON)
Stable internet routing without global coordination

IEEE/ACM Transactions on Networking (TON)
The stable paths problem and interdomain routing

IEEE/ACM Transactions on Networking (TON)
Analysis of the MED Oscillation Problem in BGP

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Policy Disputes in Path-Vector Protocols

ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Network routing with path vector protocols: theory and applications

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Design principles of policy languages for path vector protocols

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On the convergence time of a path-vector protocol

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Expected Convergence Properties of BGP

ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Robust Path-Vector Routing Despite Inconsistent Route Preferences

ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
An analysis of convergence delay in path vector routing protocols

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.24

Visualization

Abstract

The Internet composes of thousands of Autonomous System (ASes). The Border Gateway Protocol (BGP) is the standard protocol for sharing inter-domain routing information. Unlike OSPF and IS-IS, BGP allows an AS to use a lot of attributes to express semantic rich routing policies that are consistent with its desired economic, business, performance, and security goals. However, the expressiveness could cause to delay convergence or even divergence in BGP. Recent work do not rigorously analyze the impact of the general routing policies on the convergence condition and convergence time of BGP, especially considering the widely used Multi-Exit Discriminator (MED) attribute. In this paper, we will fill this gap and give the rigorous analysis on the impact of the general routing policies on the convergence condition and convergence time of BGP, including MED attribute. We first introduce a timeless model to represent BGP with the general routing policies including the MED attribute. By incorporating the timeless model we derive a sufficient condition on these general routing policies for robust convergence of BGP. We then extend the timeless model to the real-time model by adding the edge delay. Finally, we find an upper bound on convergence time of BGP by incorporating the real-time model.