On distinguishing between Internet power law topology generators
By Tian Bu, D. Towsley. Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002
575 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Statistical and Nonlinear Physics
View Paper: https://www.semanticscholar.org/paper/4ce1d2b528b61c8f5de3f31f5fbc7080b8455603
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
- Mark Newman
- Christos Faloutsos
- Alessandro Vespignani
- Deepayan Chakrabarti
- Jure Leskovec
- David Wetherall
- T. Anderson
- Romualdo Pastor-Satorras
In Statistical and Nonlinear Physics
- Jure Leskovec
- Christos Faloutsos
- Deepayan Chakrabarti
- Jon M. Kleinberg
- Mark Newman
- Alessandro Vespignani
- Manuel Gomez-Rodriguez
- Zoubin Ghahramani
Citations in the corpus
- Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience (2003, background): “Following significant research effort to model the structure of the current Internet, it was discovered that many of the existing topology generators did not accurately match the “small-world” (clustering) properties of the Internet graph [3], [4].”
- Evolution and Structure of the Internet: Index (2004, background): “5 Note that, for the case of the clustering coefficient, it is possible to define a restricted average over the vertices with degree ki ≥ 2 (Jin and Bestavros, 2002; Bu and Towsley, 2002).”
- Random walks in peer-to-peer networks (2004, background): “See also [22]–[25] and for related discussion [26].”
- Power laws and the AS-level internet topology (2003, background): “There may be more topological properties of the Internet topology that are not captured by our power-laws [45, 54].”
- Kronecker Graphs: An Approach to Modeling Networks (2008, methodology): “And, contrary to other models that match thiscombination of network properties (as for example, (Bu and Towsley, 2002; Klemm and Eguı́luz, 2002; Vázquez, 2003; Leskovec et al., 2005b; Zheleva et al., 2009)), Kronecker graphs also lead totractable analysis and rigorous proofs.”
- The internet AS-level topology: three data sources and one definitive metric (2005, unknown): “The Internet AS-Level Topology: Three Data Sources and One De.nitive Metric Priya Mahadevan Dmitri Krioukov UCSD CAIDA Xenofontas Dimitropoulos Georgia Tech Marina Fomenkov Bradley Huffaker CAIDA CAIDA kc claffy Amin Vahdat CAIDA UCSD {pmahadevan,vahdat}@cs.ucsd.edu,…”
- Measuring ISP topologies with Rocketfuel (2004, background): “While our focus is on router-level topologies, measurement and characterization of AS-level topologies has been the subject of much work [4], [6], [8].”
- Systematic topology analysis and generation using degree correlations (2006, background): “[4] T. Bu and D. Towsley.”
- Measuring ISP topologies with rocketfuel (2002, background): “While our focus is on router-level topologies, measurement and characterization of AS-level topologies has been the subject of much work [4], [6], [8].”
- Inet-3.0: Internet Topology Generator (2002, methodology): “This metric has been described in [14], [ 1 ], and [6].”
- R-MAT: A Recursive Model for Graph Mining (2004, unknown): “We compared R-MAT to the AB [1], GLP [6] and PG [20] models, chosen for their popularity or recency.”