On power-law relationships of the Internet topology
On power-law relationships of the Internet topology
复制标题
DOI：
10.1145/316188.316229
复制
发表时间：
1999-08
期刊：
影响因子：
--
通讯作者：
M. Faloutsos;P. Faloutsos;C. Faloutsos
中科院分区：
文献类型：
--
作者：
M. Faloutsos;P. Faloutsos;C. Faloutsos
尽管互联网显然是随机性的，但我们发现了一些令人惊讶的互联网拓扑结构。尽管在1997年11月至1998年12月之间，尽管在此期间增长了45％的增长，但这些幂律可容纳互联网的三个快照。我们表明，我们的幂律非常适合真实数据，从而使相关系数达到96％或更高。我们的观察结果为互联网的结构提供了一种新颖的视角。这些幂律描述了图形属性的简洁偏斜分布，例如节点Outgree。此外，这些幂律可用于估计重要参数，例如平均邻域大小，并促进协议的设计和性能分析。此外，我们可以使用它们来生成并选择现实的拓扑来进行模拟。
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.