ACM Home Page
Please provide us with feedback. Feedback
Exploiting as hierarchy for scalable route selection in multi-homed stub networks
Full text PdfPdf (214 KB)
Source Internet Measurement Conference archive
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement table of contents
Taormina, Sicily, Italy
SESSION: Distance and location table of contents
Pages: 294 - 299  
Year of Publication: 2004
ISBN:1-58113-821-0
Authors
Sanghwan Lee  University of Minnesota, Minneapolis, MN
Zhi-Li Zhang  University of Minnesota, Minneapolis, MN
Srihari Nelakuditi  University of South Carolina
Sponsors
SIGCOMM: ACM Special Interest Group on Data Communication
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 19,   Citation Count: 1
Additional Information:

abstract   references   cited by   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/1028788.1028829
What is a DOI?

ABSTRACT

Multi-homing is a common practice among many (especially large) customer (or stub) networks. Although the purpose of multi-homing is primarily for enhanced reliability, it has also increasingly been used for load balancing and latency reduction. In this paper, we address the problem of how to perform <i>scalable</i> route selection in a multi-homed <i>stub</i> network to optimize network latency to various destinations as measured by round-trip-time (RTT). A straight forward method is to simply perform RTT measurements (e.g., using ping) to each destination via each provider and select the one with the minimum RTT as the "best" next-hop to the destination. Is there a more.

To answer this question, we carry out a measurement-based study to analyze the differences of RTTs in using two different providers in a multi-homed stub network to reach a large number of randomly selected destinations. Our study reveals that because of the AS hierarchy, for a large fraction of the network prefixes, the two AS paths through two providers merge in the core of the Internet. Furthermore, the router at which the two router level paths merge is actually in the AS at which the AS level paths merge. This phenomenon causes the RTT difference between the two paths through the two providers to be determined by the <i>non shared</i> portion of the paths. Our study reveals that most of the two router level paths through the two upstream providers merge at the AS at which the two AS level paths merge. Based on this finding, we devise a scalable route (next-hop provider) selection algorithm using BGP information in a multi-homed stub network. We also present a preliminary evaluation.


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
 
2
 
3
Lakshminarayanan Subramanian, Sharad Agarwal, Jennifer Rexford, and Randy H. Katz. Characterizing the internet hierarchy from multiple vantage points. In Proc. IEEE INFOCOM, New York, NY, June 2002.
 
4
University of oregon route views project. http://www.routeviews.org.
 
5
Route science company. http://www.routescience.org.
 
6
Proficient networks. http://www.proficient.net.
 
7
Geoff Huston. Interconnection, peering and settlements--part i. In Internet Protocol Journal, Jun 1999.
8
 
9
Sanghwan Lee, Zhi-Li Zhang, and Srihari Nelakuditi. Impact of as hierarchy on multihoming performance: A stub network perspective. Technical report, Computer Science Department, Univ. of Minnesota, February 2004.
10


Collaborative Colleagues:
Sanghwan Lee: colleagues
Zhi-Li Zhang: colleagues
Srihari Nelakuditi: colleagues