Route servers for inter-domain routing
Computer Networks and ISDN 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)
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
Guidelines for interdomain traffic engineering
ACM SIGCOMM Computer Communication Review
Mechanism design for policy routing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Robustness of Class-Based Path-Vector Systems
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Detecting BGP configuration faults with static analysis
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
An architecture for stable, analyzable Internet routing
IEEE Network: The Magazine of Global Internetworking
Subjective-cost policy routing
Theoretical Computer Science
Theoretical bounds on control-plane self-monitoring in routing protocols
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Network-wide prediction of BGP routes
IEEE/ACM Transactions on Networking (TON)
Resolving inter-domain policy disputes
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
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
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
Theory and new primitives for safely connecting routing protocol instances
Proceedings of the ACM SIGCOMM 2010 conference
Safe interdomain routing under diverse commercial agreements
IEEE/ACM Transactions on Networking (TON)
Toward a practical approach for BGP stability with root cause check
Journal of Parallel and Distributed Computing
Maintaining safety in interdomain routing with hierarchical path-categories
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Analyzing BGP instances in Maude
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Wheel + ring = reel: the impact of route filtering on the stability of policy routing
IEEE/ACM Transactions on Networking (TON)
Subjective-Cost policy routing
WINE'05 Proceedings of the First international conference on Internet and Network Economics
An incremental approach to enhance the accuracy of internet routing
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
Reduction-based formal analysis of BGP instances
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
SIAM Journal on Computing
FSR: formal analysis and implementation toolkit for safe interdomain routing
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.01 |
Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy. The current interdomain routing system enables each AS to express policy using rankings that determine how each router inthe AS chooses among different routes to a destination, and filters that determine which routes are hidden from each neighboring AS. Because the Internet is composed of many independent, competing networks, the interdomain routing system should provide autonomy, allowing network operators to set their rankings independently, and to have no constraints on allowed filters. This paper studies routing protocol stability under these conditions. We first demonstrate that certain rankings that are commonly used in practice may not ensure routing stability. We then prove that, when providers can set rankings and filters autonomously, guaranteeing that the routing system will converge to a stable path assignment essentially requires ASes to rank routes based on AS-path lengths. We discuss the implications of these results for the future of interdomain routing.