An analysis of BGP convergence properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Stable Internet routing without global coordination
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
On the correctness of IBGP configuration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
BGP oscillations when peering with loopback addresses
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 02
Detecting BGP configuration faults with static analysis
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
ACM SIGCOMM Computer Communication Review
Implications of autonomy for the expressiveness of policy routing
IEEE/ACM Transactions on Networking (TON)
Modeling the routing of an autonomous system with C-BGP
IEEE Network: The Magazine of Global Internetworking
Beyond the best: real-time non-invasive collection of BGP messages
INM/WREN'10 Proceedings of the 2010 internet network management conference on Research on enterprise networking
On the stability of interdomain routing
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Internet Service Providers can enforce a fine grained control of Interdomain Routing by cleverly configuring the Border Gateway Protocol. However, the price to pay for the flexibility of BGP is the lack of convergence guarantees. Network protocol design literature introduced several sufficient conditions that routing policies should satisfy to guarantee convergence. However, to our knowledge, none of these conditions has yet been exploited to automatically check BGP policies for convergence. This paper presents two fundamental contributions. First, we describe a heuristic algorithm that statically detects potential oscillations in a BGP network. We prove that our algorithm has several highly desirable properties: i) it exceeds state of the art algorithms in that it is able to correctly report more configurations as stable, ii) it can be implemented efficiently enough to enable static analysis of Internet scale BGP configurations, iii) it is free from false negatives, and iv) it can help in spotting the troublesome points in a detected oscillation. We also propose an architecture for a modular tool that exploits our heuristic algorithm to process native router configurations and return information about the potential presence of oscillations. Such a tool can effectively integrate syntactic checkers and assist operators in verifying configurations. We validate our approach using a prototype implementation and show that it scales well enough to enable Internet scale convergence checks.