Graph annotations in modeling complex network topologies

ACM Transactions on Modeling and Computer Simulation

Volumn 19, Issue 4, 2009, Pages

  Dimitropoulos, Xenofontas ^a   Krioukov, Dmitri ^b   Vahdat, Amin ^b   Riley, George ^c  

^a IBM RESEARCH ZURICH   (Switzerland)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Annotations; AS relationships; Complex networks; Topology

Indexed keywords

ANNOTATIONS; AUTONOMOUS SYSTEMS; BUSINESS RELATIONSHIPS; COMPLEX NETWORKS; FUTURE INTERNET ARCHITECTURE; IN-DEPTH UNDERSTANDING; INTERNAL STRUCTURE; LARGE-SCALE STRUCTURE; MODELING AND SIMULATION; NETWORK APPLICATIONS; NETWORK EVOLUTION; NETWORK PROPERTIES; NETWORK TOPOLOGY; RANDOM GRAPHS; REALISTIC SIMULATION; UNWEIGHTED GRAPHS;

ELECTRIC NETWORK TOPOLOGY; INTERNET; INTERNET PROTOCOLS;

COMPUTER SIMULATION;

EID: 70450254440     PISSN: 10493301     EISSN: 15581195     Source Type: Journal    
DOI: 10.1145/1596519.1596522     Document Type: Article

References (44)

1. AIELLO,W., CHUNG, F., AND LU, L. 2000. A random graph model for massive graphs. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC).
2. ALBERT, R. AND BARAB́ASI, A.-L. 2000. Topology of evolving networks: Local events and universality. Phys. Rev. Lett. 85, 24, 5234-5237.
3. BOGŨŃA, M. AND PASTOR-SATORRAS, R. 2003. Class of correlated random networks with hidden variables. Phys. Rev. E 68, 036112.
4. BOGŨŃA, M., PASTOR-SATORRAS, R., AND VESPIGNANI, A. 2004. Cut-offs and finite size effects in scalefree networks. Eur. Phys. J. B 38, 205-209.
5. BOGŨŃA, M. AND SERRANO, M. A. 2005. Generalized percolation in random directed networks. Phys. Rev. E 72, 016106.
6. CARLSON, J. M. AND DOYLE, J. 1999. Highly optimized tolerance: A mechanism for power-laws in designed systems. Phys. Rev. E 60, 1412-1427.
7. CHAMBERS, J. M. AND HASTIE, T. J. 1992. Statistical Models in S. Wadsworth and Brooks/Cole, Pacific Grove, CA.
8. CHANG, H., JAMIN, S., ANDWILLINGER,W. 2006. To peer or not to peer: Modeling the evolution of the Internet's AS-level topology. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM).
9. CHUNG, F. AND LU, L. 2002. Connected components in random graphs with given degree sequences. Ann. Comb. 6, 125-145.
10. CLAUSET, A. AND MOORE, C. 2005. Accuracy and scaling phenomena in Internet mapping. Phys. Rev. Lett. 94, 018701.
11. DALL'ASTA, L., ALVAREZ-HAMELIN, I., BARRAT, A., V́AZQUEZ, A., AND VESPIGNANI, A. 2006. Exploring networks with traceroute-like probes: Theory and simulations. Theor. Comput. Sci, Complex Netw. 355, 1, 6-24.
12. DE LAUNOIS, C. GHITLE: Generator of Hierarchical Internet Topologies using LEvels. http://ghitle.info.ucl.ac.be/.
13. DIMITROPOULOS, X., KRIOUKOV, D., FOMENKOV, M., HUFFAKER, B., HYUN, Y., KC CLAFFY, AND RILEY, G. 2007. AS relationships: Inference and validation. Comput. Comm. Rev 37, 1.
14. DIMITROPOULOS, X., KRIOUKOV, D., HUFFAKER, B., KC CLAFFY, AND RILEY, G. 2005. Inferring AS relationships: Dead end or lively beginning? In Proceedings of the International Workshop on Experimental and Efficient Algorithms (WEA).
15. DIMITROPOULOS, X.,KRIOUKOV,D.,RILEY,G., AND KC CLAFFY. 2006. Revealing the Autonomous System taxonomy: The machine learning approach. In Proceedings of the Passive and Active Measurements Conference (PAM).
16. DIMITROPOULOS, X. AND RILEY, G. 2003. Creating realistic BGP models. In Proceedings of the IEEE International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS).
17. DOAR,M. 1996. Abetter model for generating test networks. In Proceedings of the Global Telecommunication Conference (GLOBECOM).
18. ERDOS, P. AND ŔENYI, A. 1959. On random graphs. Publ Math 6, 290-297.
19. FALOUTSOS, M., FALOUTSOS, P., AND FALOUTSOS, C. 1999. On power-law relationships of the Internet topology. In Proceedings of the ACM SIGCOMM Data Communications Festival (SIGCOMM).
20. FRANK, O. AND STRAUSS, D. 1986. Markov graphs. J. Am. Stat. Assoc. 81, 395, 832-842.
21. GAO, L. 2001. On inferring Autonomous System relationships in the Internet. IEEE ACM Trans. Netw. 9, 6.
22. GAO, L. AND WANG, F. 2002. The extent of AS path inflation by routing policies. In Proceedings of the Global Internet Symposium.
23. GKANTSIDIS, C., MIHAIL, M., AND ZEGURA, E. 2003. The Markov chain simulation method for generating connected power law random graphs. In Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX).
24. HEWITT, E. 1975. Real and Abstract Analysis: A Modern Treatment of the Theory of Functions of a Real Variable. Springer-Verlag, Berlin.
25. HÖRMANN, W., LEYDOLD, J., AND DERFLINGER, G. 2004. Automatic Nonuniform Random Variate Generation. Springer-Verlag, Berlin.
26. KRIOUKOV, D., KC CLAFFY, FALL, K., AND BRADY, A. 2007. On compact routing for the Internet. Comput. Commun. Rev. 37, 3, 41-52.
27. LAKHINA, A., BYERS, J., CROVELLA, M., AND XIE, P. 2003. Sampling biases in IP topology measurements. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM).
28. LI, L., ALDERSON, D.,WILLINGER,W., AND DOYLE, J. 2004. A first-principles approach to understanding the Internets router-level topology. In Proceedings of the ACM SIGCOMM Data Communications Festival (SIGCOMM).
29. MAHADEVAN, P., KRIOUKOV, D., FALL, K., AND VAHDAT, A. 2006a. Systematic topology analysis and generation using degree correlations. In Proceedings of the ACM SIGCOMM Data Communications Festival (SIGCOMM).
30. MAHADEVAN, P.,KRIOUKOV,D., FOMENKOV, M.,HUFFAKER, B.,DIMITROPOULOS, X., KC CLAFFY, ANDVAHDAT, A. 2006b. The Internet AS-level topology: Three data sources and one definitive metric. Comput. Commun. Rev. 36, 1, 17-26.
31. MASLOV, S., SNEPPEN, K., AND ZALIZNYAK, A. 2004. Detection of topological patterns in complex networks: Correlation profile of the Internet. Physica A 333, 529-540.
32. MEDINA, A., LAKHINA, A., MATTA, I., AND BYERS, J. 2001. BRITE: An approach to universal topology generation. In Proceedings of the IEEE International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS).
33. NELSON, R. B. 1999. An introduction to copulas. Lecture Notes in Statistics, vol.139, Springer-Verlag, 216.
34. PALMER, C. AND STEFFAN, G. 2000. Generating network topologies that obey power laws. In Proceedings of the Global Telecommunication Conference (GLOBECOM).
35. PANDEY, J., KOYUTURK, M., KIM, Y., SZPANKOWSKI, W., SUBRAMANIAM, S., AND GRAMA, A. 2007. Functional annotation of regulatory pathways. Bioinformatics 23, 13, i377-i386.
36. PASTOR-SATORRAS, R. ANDVESPIGNANI,A. 2004. Evolution and Structure of the Internet:AStatistical Physics Approach. Cambridge University Press, Cambridge, U.K.
37. SKLAR, A. 1959. Fonctions de ŕepartition ̀a n dimensions et leures marges. Publications de l'Institut de Statistique de L'Universit́e de Paris 8, 229-231.
38. SÖDERBERG, B. 2002. A general formalism for inhomogeneous random graphs. Phys. Rev. E 66, 066121.
39. SÖDERBERG, B. 2003a. Properties of random graphs with hidden color. Phys. Rev. E 68, 026107.
40. SÖDERBERG, B. 2003b. Random graphs with hidden color. Phys. Rev. E 68, 015102(R).
41. SÖDERBERG, B. 2005. Random Feynman graphs. In AIP Conf. Proc. 776, 118-132.
42. WAXMAN, B. M. 1988. Routing of multipoint connections. J. Select. Areas. Comm.
43. WINICK, J. AND JAMIN, S. 2002. Inet-3.0: Internet topology generator. Tech. rep. UM-CSE-TR-456-502, University of Michigan.
44. ZEGURA, E. W., CALVERT, K., AND BHATTACHARJEE, S. 1996. How to model an internetwork. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM).