On the origin of power laws in Internet topologies

By Alberto Medina, Ibrahim Matta, John W. Byers. CCRV, 2000

524 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/9cebb1b2825cdf08e1caf542fb3efb410fe9d720

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Statistical and Nonlinear Physics

Citations in the corpus

On distinguishing between Internet power law topology generators (2002, methodology): “node degree power law, [12], and subsequent works concerned with generating power laws, [5] [6] [10] [15] [18], several other works deserve mention.”
Inet-3.0: Internet Topology Generator (2002, methodology): “Like characteristic path length, the clustering coefficient has been popularized by the interest in “small-world” graphs [14], and has been used to characterize Internet topologies in [1, 7].”
Statistical mechanics of complex networks (2001, background): “…could contribute to the correct topology, reaffirming that growth and preferential attachment are necessary conditions for realistic Internet models (Medina et al., 2000; Palmer and Steffan, 2000; Jeong, Néda, and Barabási, 2001; Pastor-Satorras et al., 2001; Yook, Jeong, and Barabási, 2001b).”
R-MAT: A Recursive Model for Graph Mining (2004, unknown): “The BRITE graph generator [15] uses components from several of the above models.”
A Brief History of Generative Models for Power Law and Lognormal Distributions (2004, methodology): “A Brief History of Generative Models for Power Law and Lognormal Distributions.”
Power laws and the AS-level internet topology (2003, background): “In addition, significant work has been devoted in understanding the origin [36], and generating power-law topologies [26], [35], [36], [42], [54], [58].”
BRITE: Universal Topology Generation from a User''s Perspective (2001, methodology): “Some of them mainly aim to generate random topologies [25], others aim to imitate the hierarchical properties of the Internet [5, 8], and still others aim to reproduce degree-related properties of the Internet [16, 13, 1].”
Graph mining: Laws, generators, and algorithms (2006, unknown): “This allows the user a lot of .exibility and is one reason behind the widespread use of BRITE in the networking community.”
Modeling the Internet's large-scale topology (2001, background): “These insights motivated the development of a new brand of Internet topology generators 7,19 that offer scale-free topologies in better agreement with empirical data.”
Complex networks: small-world, scale-free and beyond (2003, unknown): “Table 1 shows some examples that might interest the circuits and systems community (for example, the discovery of the scale-free feature of the Internet has motivated the development of a new brand of Internet topology generators [9-12]).”
On multiple description streaming with content delivery networks (2002, background): “BRITE models incremental growth and preferential connectivity in networks [20], [21], which are possible causes for power-laws observed in Internet topologies [22].”