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)
Tussle in cyberspace: defining tomorrow's internet
IEEE/ACM Transactions on Networking (TON)
A BGP-based mechanism for lowest-cost routing
Distributed Computing - Special issue: PODC 02
Source selectable path diversity via routing deflections
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
MIRO: multi-path interdomain routing
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A measurement study on the impact of routing events on end-to-end internet path performance
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
NIRA: a new inter-domain routing architecture
IEEE/ACM Transactions on Networking (TON)
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Accountable internet protocol (aip)
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
R-BGP: staying connected In a connected world
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Network architecture for joint failure recovery and traffic engineering
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Network architecture for joint failure recovery and traffic engineering
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Hi-index | 0.00 |
Multipath routing is a promising technique to increase the Internet's reliability and to give users greater control over the service they receive. However, past proposals choose paths which are not guaranteed to have high diversity. In this paper, we propose yet another multipath routing scheme (YAMR) for the interdomain case. YAMR provably constructs a set of paths that is resilient to any one inter-domain link failure, thus achieving high reliability in a systematic way. Further, even though YAMR maintains more paths than BGP, it actually requires significantly less control traffic, thus alleviating instead of worsening one of the Internet's scalability problems. This reduction in churn is achieved by a novel hiding technique that automatically localizes failures leaving the greater part of the Internet completely oblivious.