On Power-Law Relationships of the Internet Topology (1999)
Cached
Download Links
- [www.cs.ucr.edu]
- [www-2.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.cs.northwestern.edu]
- [cs.wisc.edu]
- [cs.wisc.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In SIGCOMM |
| Citations: | 1010 - 55 self |
BibTeX
@INPROCEEDINGS{Faloutsos99onpower-law,
author = {Michalis Faloutsos and Petros Faloutsos and Christos Faloutsos},
title = {On Power-Law Relationships of the Internet Topology},
booktitle = {In SIGCOMM},
year = {1999},
pages = {251--262}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Despite the apparent randomness of the Internet, we discover some surprisingly simple power-laws of the Internet topology. These power-laws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period. We show that our power-laws fit the real data very well resulting in correlation coefficients of 96% or higher. Our observations provide a novel perspective of the structure of the Internet. The power-laws describe concisely skewed distributions of graph properties such as the node outdegree. In addition, these power-laws can be used to estimate important parameters such as the average neighborhood size, and facilitate the design and the performance analysis of protocols. Furthermore, we can use them to generate and select realistic topologies for simulation purposes. 1 Introduction "What does the Internet look like?" "Are there any topological properties that don't change in time?" "How will it look like a year ...
Citations
No citations identified.
