On power-law relationships of the Internet topology

• Michalis Faloutsos

  Carnegie Mellon Univ., Dept. of Comp. Science

• Petros Faloutsos

• Christos Faloutsos

抄録

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.

収録刊行物

• ACM SIGCOMM Computer Communication Review

  ACM SIGCOMM Computer Communication Review 29 (4), 251-262, 1999-08-30

  Association for Computing Machinery (ACM)

キーワード

• Computer Networks and Communications
• Software

詳細情報

• CRID: 1360292619137215232
• NII論文ID: 80011326522
• DOI: 10.1145/316194.316229
• ISSN: 01464833
• ISSN: http://id.crossref.org/issn/01464833
• Web Site: https://dl.acm.org/doi/pdf/10.1145/316194.316229
• データソース種別:
  • Crossref
  • CiNii Articles