Systematic topology analysis and generation using degree correlations

Computer Communication Review

Volumn 36, Issue 4, 2006, Pages 135-146

  Mahadevan, Priya ^a   Krioukov, Dmitri ^b   Fall, Kevin ^c   Vahdat, Amin ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CAIDA ^*  (United States)

^c INTEL CORPORATION   (United States)

Author keywords

Degree correlations; Network topology

Indexed keywords

DEGREE CORRELATIONS; DK-SERIES; GRAPH METRIC; INTERNET TOPOLOGIES;

ALGORITHMS; GRAPH THEORY; INTERNET; NETWORK PROTOCOLS; PROBABILITY DISTRIBUTIONS; ROUTERS;

ELECTRIC NETWORK TOPOLOGY;

EID: 33750290186     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/1151659.1159930     Document Type: Conference Paper

References (32)

1. W. Aiello, F. Chung, and L. Lu. A random graph model for massive graphs. In STOC, 2000.
2. M. Boguñá and R. Pastor-Satorras. Class of correlated random networks with hidden variables. Physical Review E, 68:036112, 2003.
3. M. Boguñá, R. Pastor-Satorras, and A. Vespignani. Cut-offs and finite size effects in scale-free networks. European Physical Journal B, 38:205-209, 2004.
4. T. Bu and D. Towsley. On distinguishing between Internet power law topology generators. In INFOCOM, 2002.
5. CAIDA. Macroscopic topology AS adjacencies. http://www.caida.org/tools/ measurement/skitter/as_adjacencies.xml.
6. H. Chang, S. Jamin, and W. Willinger. To peer or not to peer: Modeling the evolution of the Internet's AS-level topology. In INFOCOM, 2006.
7. F. Chung and L. Lu. Connected components in random graphs with given degree sequences. Annals of Combinatorics, 6:125-145, 2002.
8. F. K. R. Chung. Spectral Graph Theory, volume 92 of Regional Conference Series in Mathematics. American Mathematical Society, Providence, RI, 1997.
9. S. N. Dorogovtsev. Networks with given correlations. http://arxiv.org/ abs/cond-mat/0308336v1.
10. S. N. Dorogovtsev. Clustering of correlated networks. Physical Review E, 69:027104, 2004.
11. S. N. Dorogovtsev and J. F. F. Mendes. Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford University Press, Oxford, 2003.
12. P. Erdos and A. Rényi. On random graphs. Publicationes Mathematicae, 6:290-297, 1959.
13. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In SIGCOMM, 1999.
14. P. Fraigniaud. A new perspective on the small-world phenomenon: Greedy routing in tree-decomposed graphs. In ESA, 2005.
15. C. Gkantsidis, M. Mihail, and E. Zegura. The Markov simulation method for generating connected power law random graphs. In ALENEX, 2003.
16. P. Harremoës. Binomial and Poisson distributions as maximum entropy distributions. Transactions on Information Theory, 47(5):2039-2041, 2001.
17. Internet Routing Registries. http://www.irr.net/.
18. D. Krioukov, K. Fall, and X. Yang. Compact routing on Internet-like graphs. In INFOCOM, 2004.
19. L. Li, D. Alderson, W. Willinger, and J. Doyle. A first-principles approach to understanding the Internets router-level topology. In SIGCOMM, 2004.
20. P. Mahadevan, D. Krioukov, M. Fomenkov, B. Huffaker, X. Dimitropoulos, kc daffy, and A. Vahdat. The Internet AS-level topology: Three data sources and one definitive metric. Computer Communication Review, 36(1), 2006.
21. S. Maslov, K. Sneppen, and A. Zaliznyak. Detection of topological patterns in complex networks: Correlation profile of the Internet. Physica A, 333:529-540, 2004.
22. A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: An approach to universal topology generation. In MASCOTS, 2001.
23. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller. Equation-of-state calculations by fast computing machines. Journal of Chemical Physics, 21:1087, 1953.
24. M. Molloy and B. Reed. A critical point for random graphs with a given degree sequence. Random Structures and Algorithms, 6:161-179, 1995.
25. M. E. J. Newman. Assortative mixing in networks. Physical Review Letters, 89:208701, 2002.
26. University of Oregon RouteViews Project. http://www.routeviews.org/.
27. M. A. Serrano and M. Boguñá. Tuning clustering in random networks with arbitrary degree distributions. Physical Review E, 72:036133, 2005.
28. N. J. A. Sloane. Sequence A001349. The On-Line Encyclopedia of Integer Sequences. http://www.research.att.com/projects/OEIS?Anum=A001349.
29. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topology generators: Degree-based vs. structural. In SIGCOMM, 2002.
30. A. Vázquez, R. Pastor-Satorras, and A. Vespignani. Large-scale topological and dynamical properties of the Internet. Physical Review E, 65:066130, 2002.
31. F. Viger and M. Latapy. Efficient and simple generation of random simple connected graphs with prescribed degree sequence. In COCOON, 2005.
32. J. Winick and S. Jamin. Inet-3.0: Internet topology generator. Technical Report UM-CSE-TR-456-02, University of Michigan, 2002.