Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
A comparison of overlay routing and multihoming route control
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
End-to-End QoS in Interdomain Routing
ICNS '06 Proceedings of the International conference on Networking and Services
MIRO: multi-path interdomain routing
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
AS relationships: inference and validation
ACM SIGCOMM Computer Communication Review
Improving the reliability of internet paths with one-hop source routing
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Translator Trust for the Internet Inter-domain Routing
FGCN '07 Proceedings of the Future Generation Communication and Networking - Volume 01
R-BGP: staying connected In a connected world
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
INM/WREN'10 Proceedings of the 2010 internet network management conference on Research on enterprise networking
Hi-index | 0.01 |
The current interdomain routing protocol, BGP, is not resilient to a path failure due to its single-path and slowly-converging route calculation. This paper proposes a novel approach to improve the resilience of the interdomain communication by enabling a set of ASes to form an alliance for themselves. The alliance members cooperatively discover a set of disjoint paths using not only the best routes advertised via BGP but also the ones unadvertised. Since such a set of disjoint paths are unlikely to share a link or an AS failure, a member AS can provide a pair of the other members with a transit to circumvent the failure. We evaluate how many disjoint paths we could discover from both advertised and hidden (unadvertised) routes by analyzing publicly available BGP route data. Our feasibility study indicates that an alliance of ASes can establish a set of disjoint paths between arbitrary pair of its alliance members to improve the resilience of interdomain routing among the members.