Stable Internet routing without global coordination
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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)
On the correctness of IBGP configuration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Realistic BGP traffic for test labs
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
Network routing with path vector protocols: theory and applications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Extending and enhancing GT-ITM
MoMeTools '03 Proceedings of the ACM SIGCOMM workshop on Models, methods and tools for reproducible network research
An Internet scale simulation setup for BGP
ACM SIGCOMM Computer Communication Review
On the convergence time of a path-vector protocol
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Routing design in operational networks: a look from the inside
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
HLP: a next generation inter-domain routing protocol
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)
Incentive-compatible interdomain routing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Building an AS-topology model that captures route diversity
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Policy-based routing with non-strict preferences
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modified flap damping mechanism to improve inter-domain routing convergence
Computer Communications
Stabilizing inter-domain routing in the Internet
Journal of High Speed Networks - Self-Stabilizing Systems, Part 1
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective
Graph-Theoretic Concepts in Computer Science
On understanding transient interdomain routing failures
IEEE/ACM Transactions on Networking (TON)
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
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
A stabilizing solution to the stable path problem
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Modeling BGP table fluctuations
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Increasing bisemigroups and algebraic routing
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
The internet's unexploited path diversity
IEEE Communications Letters
A distributed method for dynamic resolution of BGP oscillations
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The Complexity of Restricted Variants of the Stable Paths Problem
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
On the convergence condition and convergence time of BGP
Computer Communications
Safe interdomain routing under diverse commercial agreements
IEEE/ACM Transactions on Networking (TON)
Expected convergence properties of BGP
Computer Networks: The International Journal of Computer and Telecommunications Networking
On reducing the impact of interdomain route changes
PAM'11 Proceedings of the 12th international conference on Passive and active measurement
Maintaining safety in interdomain routing with hierarchical path-categories
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
SIMROT: a scalable inter-domain routing toolbox
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
Wheel + ring = reel: the impact of route filtering on the stability of policy routing
IEEE/ACM Transactions on Networking (TON)
Comprehensive solution for anomaly-free BGP
IPOM'05 Proceedings of the 5th IEEE international conference on Operations and Management in IP-Based Networks
Characterizing and reducing route oscillations in the Internet
Computer Communications
On the stability of interdomain routing
ACM Computing Surveys (CSUR)
SIAM Journal on Computing
A theory for the connectivity discovered by routing protocols
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
The Border Gateway Protocol, BGP, is currently the only inter-domain routing protocol employed on the Internet. As required of any inter-domain protocol, BGP allows policy-based metrics to override distance-based metrics and enables each autonomous system to independently define its routing policies with little or no global coordination. Varadhan et al. have shown that there are collections of routing policies that together are not safe in the sense that they can cause BGP to diverge. That is, an unsafe collection of routing policies can result in some autonomous systems exchanging BGP routing messages indefinitely, without ever converging to a set of stable routes. In this paper we present sufficient conditions on routing policies that guarantee BGP safety.We use a new formalism, called the Simple Path Vector Protocol (SPVP), that is designed to capture the underlying semantics of any path vector protocol such as BGP. We identify a certain circular set of relationships between routing policies at various autonomous systems that we call a dispute cycle. We show that systems with no dispute cycles are guaranteed to be safe. While these include systems whose policies are consistent with shortest paths under some link metric, the class of systems with no dispute cycles is strictly larger.