Guaranteed fault containment and local stabilization in routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective
Graph-Theoretic Concepts in Computer Science
Bringing order to BGP: Decreasing time and message complexity
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast BGP convergence following link/router failure
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Asynchronous and fully self-stabilizing time-adaptive majority consensus
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
On the stability of interdomain routing
ACM Computing Surveys (CSUR)
Fault-tolerant dynamic routing based on maximum flow evaluation
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
Hi-index | 0.01 |
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.