ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Networks
Volume 45, Issue 1, 15 May 2004, Pages 35-44
The Global Internet
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (370 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comnet.2004.02.004    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier B.V. All rights reserved.

Representing the Internet as a succinct forest

Jim GastCorresponding Author Contact Information, E-mail The Corresponding Author, a, 1 and Paul Barfordb, 2

a Computer Science and Software Engineering, University of Wisconsin, Platteville, WI 53818, USA b Computer Sciences, University of Wisconsin, Madison, WI 53706, USA

Available online 25 February 2004.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of autonomous system (AS) topology derived solely from routing tables show only a subset of the connections that actually get used. However, in many cases, missing connections can be discovered by simple traceroutes. In addition, the differences between customer-to-provider links, peer-to-peer links, and sibling-to-sibling links are useful distinctions. We first apply a clustering algorithm to simplify the AS graph to an AS forest. Then we use two complementary mechanisms to improve accuracy of an AS forest as a predictor of packet paths. One mechanism uses recent insights that packets flow unidirectionally across customer–provider inter-AS links. Annotations are added to the AS forest to indicate links that appear to be peering versus those that appear to be customer–provider links. The other mechanism provides links between trees by remembering the most recently seen similar traceroute.

Author Keywords: Internet topology; Autonomous system clustering; Traceroute; Internet routing; Autonomous system relationships; Border gateway protocol

Article Outline

1. Introduction
1.1. Step 1. Building a representation of the Internet at the AS level
1.2. Step 2. Calibrating the relative depths
1.3. Step 3. Adding missing links and an alternate parent
2. Related work
3. Topologically guided clustering
3.1. Finding the centroid
3.2. Definitions
3.3. Clustering ASes using BGP routing data
3.4. Initial annotations
4. Annotating the AS forest
4.1. Choosing traceroute destinations
4.2. Noting the relationship between AS's
4.3. Translating IP traceroute to AS traceroute
4.4. Adding learned relatives
5. Conclusions
Acknowledgements
References
Vitae









Computer Networks
Volume 45, Issue 1, 15 May 2004, Pages 35-44
The Global Internet
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.