Delayed Internet routing convergence
IEEE/ACM Transactions on Networking (TON)
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)
Understanding BGP misconfiguration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Collecting the internet AS-level topology
ACM SIGCOMM Computer Communication Review
Incentive-compatible interdomain routing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Improving web availability for clients with MONET
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
A study of prefix hijacking and interception in the internet
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Rationality and traffic attraction: incentives for honest path announcements in bgp
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
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
Towards understanding bugs in open source router software
ACM SIGCOMM Computer Communication Review
R-BGP: staying connected In a connected world
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
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
Strategic pricing in next-hop routing with elastic demands
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
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
Anatomy of a large european IXP
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Computational complexity of traffic hijacking under BGP and S-BGP
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Anatomy of a large european IXP
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
A new approach to interdomain routing based on secure multi-party computation
Proceedings of the 11th ACM Workshop on Hot Topics in Networks
FSR: formal analysis and implementation toolkit for safe interdomain routing
IEEE/ACM Transactions on Networking (TON)
BGP-XM: BGP eXtended Multipath for transit Autonomous Systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
An approach to stabilize interdomain routing protocol after failure
Computers and Electrical Engineering
Sign what you really care about - Secure BGP AS-paths efficiently
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of interdomain routing policies
ACM SIGCOMM Computer Communication Review
Strategic Pricing in Next-Hop Routing with Elastic Demands
Theory of Computing Systems
Hi-index | 0.01 |
BGP is plagued by many serious problems, ranging from protocol divergence and software bugs to misconfigurations and attacks. Rather than continuing to add mechanisms to an already complex protocol, or redesigning interdomain routing from scratch, we propose making BGP simpler. We argue that the AS-PATH, which lists the sequence of ASes that propagated the route, is the root of many of BGP's problems. We propose a transition from today's path-based routing to a solution where ASes select and export routes based only on neighboring ASes. We discuss the merits and limitations of next-hop routing. We argue that next-hop routing is sufficiently expressive to realize network operator's goals while side-stepping major problems with today's BGP. Specifically, we show that next-hop routing simplifies router implementation and configuration, reduces BGP's attack surface, makes it easier to support multipath routing, and provably achieves faster convergence and incentive compatibility. Our simulations show that next-hop routing significantly reduces the number of update messages and routing changes, and is especially effective at preventing the most serious convergence problems.