ACM Home Page
Please provide us with feedback. Feedback
Analysis of the autonomous system network topology
Full text PdfPdf (1.11 MB)
Source ACM SIGCOMM Computer Communication Review archive
Volume 31 ,  Issue 3  (July 2001) table of contents
SESSION: Papers table of contents
Pages: 26 - 37  
Year of Publication: 2001
ISSN:0146-4833
Authors
Damien Magoni  LSIIT-ULP, Bld Sébastien Brant, Illkirch, France
Jean Jacques Pansiot  LSIIT-ULP, Bld Sébastien Brant, Illkirch, France
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 46,   Citation Count: 15
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Mapping the Internet is a major challenge for network researchers. It is the key to building a successful modeling tool able to generate realistic graphs for use in networking simulations. In this paper we provide a detailed analysis of the inter-domain topology of the Internet. The collected data and the resulting analysis began in November 1997 and cover a period of two and a half years. We give results concerning major topology properties (nodes and edges number, average degree and distance, routing policy, etc.) and main distributions (degree, distance, etc.). We also present many results about the trees of this network. The evolution of these properties is reviewed and major trends are highlighted. We propose some empirical laws that match this current evolution. Four new power-laws concerning the number of shortest paths between node pairs and the tree size distribution are provided with their detailed validation.


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
V. Fuller, T. Li, J. Yu, and K. Varadhan. Classless inter-domain routing (cidr) : an address assignment and aggregation strategy. Request For Comments 1519, Internet Engineering Task Force, September 1993.
 
3
 
4
R. Govindan and H. Tangmunarunkit. Heuristics for internet map discovery. In Proceedings of IEEE Infocom'00, Tel Aviv, Israël, 2000.
 
5
D. Grad, J.-J. Pansiot, and S. Marc-Zwecker. Distributed computation of reduced multicast trees. In Proceedings of TDP'96, pages 91-107, La Londe les Maures, June 1996.
 
6
J. Hawkinson and T. Bates. Guidelines for creation, selection and registration of an autonomous system (as). Request For Comments 1930, Internet Engineering Task Force, March 1996.
 
7
K. Hubbard, M. Kosters, D. Conrad, D. Karrenberg, and J. Postel. Internet registry ip allocation guidelines. Request For Comments 2050, Internet Engineering Task Force, November 1996.
 
8
J. Kenney and E. Keeping. Mathematics of Statistics, chapter 15, Linear Regression and Correlation, pages 252-285. Van Nostrand, 3rd edition, 1962.
9
 
10
National Laboratory for Applied Network Research, http://moat.nlanr.net/Routing/rawdata/. BGP data from route-views. Supported by NSF.
11
 
12
J.-J. Pansiot, D. Grad, and S. Marc-Zwecker. Towards a logical addressing and routing sublayer for internet multicasting. In Proceedings of PROMS'95, pages 521-535, Salzburg, Austria, October 1995.
 
13
 
14
Y. Rekhter and P. Gross. Application of the border gateway protocol in the internet. Request For Comments 1772, Internet Engineering Task Force, March 1995.
 
15
Y. Rekhter and T. Li. An architecture for ip address allocation with cidr. Request For Comments 1518, Internet Engineering Task Force, September 1993.
 
16
Y. Rekhter and T. Li. A border gateway protocol 4 (bgp-4). Request For Comments 1771, Internet Engineering Task Force, March 1995.
 
17
Y. Rekhter and T. Li. Implications of various address allocation policies for internet routing. Request For Comments 2008, Internet Engineering Task Force, October 1996.
 
18
H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin. The impact of routing policy on internet paths. In Proceedings of IEEE Infocom'01, Anchorage, Alaska, USA, 2001.
 
19
E. Whittaker and G. Robinson. The Calculus of Observations: A Treatise on Numerical Mathematics, chapter 9, The Method of Least Squares. Dover, 4th edition, 1967.

CITED BY  15

Collaborative Colleagues:
Damien Magoni: colleagues
Jean Jacques Pansiot: colleagues