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
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
Route flap damping exacerbates internet routing convergence
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Route oscillations in I-BGP with route reflection
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
BGP routing stability of popular destinations
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
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
Design principles of policy languages for path vector protocols
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
BGP Design and Implementation
Robustness of Class-Based Path-Vector Systems
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
A Stability-Oriented Approach to Improving BGP Convergence
SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
An algebraic theory of dynamic network routing
IEEE/ACM Transactions on Networking (TON)
Policy-based routing with non-strict preferences
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Mechanism design for policy routing
Distributed Computing - Special issue: PODC 04
Preventing persistent oscillations and loops in IBGP configuration with route reflection
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computing the types of the relationships between autonomous systems
IEEE/ACM Transactions on Networking (TON)
Robust Path-Vector Routing Despite Inconsistent Route Preferences
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
A fractional model of the border gateway protocol (BGP)
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Implications of autonomy for the expressiveness of policy routing
IEEE/ACM Transactions on Networking (TON)
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Inter-domain routing for mobile ad hoc networks
Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective
Graph-Theoretic Concepts in Computer Science
Neighbor-specific BGP: more flexible routing policies while improving global stability
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
On the feasibility of static analysis for BGP convergence
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
A stabilizing solution to the stable path problem
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
The stratified shortest-paths problem
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
BGP churn evolution: a perspective from the core
INFOCOM'10 Proceedings of the 29th conference on Information communications
A distributed method for dynamic resolution of BGP oscillations
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Neighbor-specific BGP: An algebraic exploration
ICNP '10 Proceedings of the The 18th IEEE International Conference on Network Protocols
Assigning AS relationships to satisfy the Gao-Rexford conditions
ICNP '10 Proceedings of the The 18th IEEE International Conference on Network Protocols
Acyclic type-of-relationship problems on the internet
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Secure Border Gateway Protocol (S-BGP)
IEEE Journal on Selected Areas in Communications
A Game-Theoretical Study of Robust Networked Systems
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Most routing protocols guarantee convergence to a stable routing state. That is, in the absence of topology or configuration changes, each router will eventually find a stable route to any destination. However, this is not the case for policy-based routing protocols, for example, the BGP protocol used as a de facto standard for interdomain routing. The interaction of not-so-complex BGP configurations can cause permanent oscillations of routing. Several models and algorithms have been proposed in the literature to study routing oscillations. This article surveys state-of-the-art contributions in this field, with a special emphasis on algorithmic and combinatorial aspects.