ACM Home Page
Please provide us with feedback. Feedback
AS alliance: cooperatively improving resilience of intra-alliance communication
Full text PdfPdf (184 KB)
Source International Conference On Emerging Networking Experiments And Technologies archive
Proceedings of the 2008 ACM CoNEXT Conference table of contents
Madrid, Spain
Article No. 76  
Year of Publication: 2008
ISBN:978-1-60558-210-8
Authors
Yuichiro Hei  KDDI R&D Laboratories, Inc.
Akihiro Nakao  The University of Tokyo and NICT
Toru Hasegawa  KDDI R&D Laboratories, Inc.
Tomohiko Ogishi  KDDI R&D Laboratories, Inc.
Shu Yamamoto  NICT
Sponsors
ACM: Association for Computing Machinery
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): ,   Downloads (12 Months): ,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1544012.1544088
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
The CAIDA AS relationships dataset. http://www.caida.org/data/active/as-relationships/.
 
2
PlanetLab. http://www.planet-lab.org.
 
3
RIPE routing information service (RIS). http://www.ripe.net/projects/ris/index.html.
 
4
Route views project. http://www.routeviews.org.
5
6
 
7
I. Avramopoulos, M. Suchara, and J. Rexford. How small groups can secure interdomain routing. http://www.cs.prinston.edu/research/techreps/TR-808-07.
8
 
9
 
10
S. H. Khor and A. Nakao. AI-RON-E: Prophecy of one-hop source routers. In Proc. of IEEE GLOBECOM, 2008.
 
11
 
12
N. Kushman, S. Kandula, D. Katabi, and B. Maggs. R-BGP: Staying connected in a connected world. In 4th USENIX Symposium on NSDI, April 2007.
13
14
 
15
Y. Rekhter, T. Li, and S. Hares. A border gateway protocol 4 (BGP-4). RFC 4271, January 2006.
 
16
17

Collaborative Colleagues:
Yuichiro Hei: colleagues
Akihiro Nakao: colleagues
Toru Hasegawa: colleagues
Tomohiko Ogishi: colleagues
Shu Yamamoto: colleagues