Orbis: Rescaling degree correlations to generate annotated internet topologies

ACM SIGCOMM 2007: Conference on Computer Communications

Volumn , Issue , 2007, Pages 325-336

  Mahadevan, Priya ^a   Hubble, Calvin ^a   Krioukov, Dmitri ^b   Huffaker, Bradley ^b   Vahdat, Amin ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CAIDA ^*  (United States)

Author keywords

Degree correlations; Network topology

Indexed keywords

DEGREE CORRELATIONS; GRAPH PROPERTIES; INTERNET TOPOLOGY; NETWORK SERVICES;

CORRELATION METHODS; GRAPH THEORY; INFORMATION SERVICES; NETWORK MANAGEMENT;

INTERNET;

EID: 36949034674     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1282380.1282417     Document Type: Conference Paper

References (34)

1. W. Aiello, F. Chung, and L. Lu. A random graph model for massive graphs. In STOC, 2000.
2. A. Bavier, N. Feamster, M. Huang, L. Peterson, and J. Rexford. In VINI Veritas: Realistic and controlled network experimentation. In SIGCOMM, 2006.
3. M. Boguñá, R. Pastor-Satorras, and A. Vespignani. Cut-offs and finite size effects in scale-free networks. Eumpean Physical Journal B, 38:205-209, 2004.
4. CAIDA. Iffinder. http://www.caida.org/tools/measurement/iffinder/.
5. CAIDA. Macroscopic topology AS adjacencies. http://www.caida.org/tools/ measurement/skitter/as_adjacencies.xml.
6. M. Casado and M. J. Freedman. Peering through, the shroud: The effect of edge opacity on IP-based client identification. In USENIX, 2007.
7. 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.
8. F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: A decentralized network coordinate system, In SIGCOMM, 2004.
9. L. Dall'Asta, I. Alvarez-Hamelin, A. Barrat, A. Vázquez, and A. Vespignani. Exploring networks with traceroute-like probes: Theory and simulations. Theoretical Computer Science, Special Issue on Complex Networks, 2005.
10. DETER, http://www.isi.edu/deter/.
11. P. Erdós and A. Rényi. On random graphs. Publicationes Mathematicae, 6:290-297, 1959.
12. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In SIGCOMM, 1999.
13. L. Gao and F. Wang. The extent of AS path inflation by routing policies. In IEEE Global Internet Symposium, 2002.
14. GENI: Global environment for network innovations. http://www.geni.net/.
15. R. Govindam and H. Tangmunarunkit. Heuristics for Internet map discovery. In INFOCOM, 2000.
16. L. Li, D. Alderson, W. Willinger, and J. Doyle. A first-principles approach to understanding the Internets router-level topology. In SIGCOMM, 2004.
17. H. Madhyastha, T. Isdal, M. Piatek, C. Dixon, T. Anderson, A. Krishnamurthy, and A. Venkataramani. iPlane: An information plane for distributed services. In OSDI, 2006.
18. P. Mahadevan, D. Krioukov, K. Fall, and A. Vahdat. Systematic topology analysis and generation using degree correlations. In SIGCOMM, 2006.
19. P. Mahadevan, D. Krioukov, M. Fomenkov, B. Huffaker, X. Dimitropoulos, kc claffy, and A. Vahdat. The Internet AS-level topology: Three data sources and one definitive metric. Computer Communication Review, 36(1), 2006.
20. Z. M. Mao, L. Qiu, J. Wang, and Y. Zhang. On AS-level path inference. In SIGMETRICS, 2005.
21. A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: An approach to universal topology generation. In MASCOTS, 2001.
22. M. E. J. Newman. Assortative mixing in networks. Physical Review Letters, 89:208701, 2002.
23. T. S. E. Ng and H. Zhang. A network positioning system for the Internet. In USENIX, 2004.
24. The network simulator ns - 2. http://www.isi.edu/nsnam/ns/.
25. University of Oregon Route Views Project. http://www.routeviews.org/.
26. N. Spring, R. Mahajan, and T. Anderson. Quantifying the causes of path inflation. In SIGCOMM, 2003.
27. N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with Rocketfuel. In SIGCOMM, 2002.
28. H. Tangmunarunkit, J. Doyle, R. Govindan, S. Jamin, W. Willinger, and S. Shenker. Does AS size determine AS degree? Computer Communication Review, 31(5), 2001.
29. H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin. The impact of routing policy on Internet paths. In INFOCOM, 2001.
30. A. Vahdat, K. Yocum, K. Walsh, P. Mahadevan, D. Kostic, J. Chase, and D. Becker. Scalability and accuracy in a large-scale network emulator. In OSDI, 2002.
31. B. M. Waxman. Routing of multipoint connections. IEEE JSAC, 1988.
32. B. White, J. Lepreau, L. Stoller, R. Ricci, S. Guruprasad, M. Newbold, M. Hibler, C. Barb, and A. Joglekar. An integrated experimental environment for distributed systems and networks. In OSDI, 2002.
33. J. Winick and S. Jamin, Inet-3.0: Internet topology generator. Technical Report UM-CSE-TR-456-02, University of Michigan, 2002.
34. E. Zegura, K. Calvert, and S. Bhattacharjee. How to model an internetwork. In INFOCOM, 1996.