Journal of Communications and Networks

  • 제8권3호
  • /
  • Pages.339-350
  • /
  • 2006
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지

Jellyfish: A Conceptual Model for the AS Internet Topology

  • 발행 : 2006.09.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Several novel concepts and tools have revolutionized our understanding of the Internet topology. Most of the existing efforts attempt to develop accurate analytical models. In this paper, our goal is to develop an effective conceptual model: A model that can be easily drawn by hand, while at the same time, it captures significant macroscopic properties. We build the foundation for our model with two thrusts: a) We identify new topological properties and b) we provide metrics to quantify the topological importance of a node. We propose the jellyfish as a model for the inter-domain Internet topology. We show that our model captures and represents the most significant topological properties. Furthermore, we observe that the jellyfish has lasting value: It describes the topology for more than six years.

키워드

참고문헌

  1. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, 'Graph structure in the web: Experiments and models,' in Proc. World Wide Web Conf., 2000
  2. G. Siganos, M. Faloutsos, P. Faloutsos, and C. Faloutsos, 'Power-laws and the AS-level Internet topology,' IEEE/ACM Trans. Networking, 2003
  3. J.-J. Pansiot and D Grad, 'On routes and multicast trees in the Internet,' ACM Sigcomm Computer Commun. Rev., 1998
  4. D. Magoni and J. J. Pansiot, 'Analysis ofthe autonomous system network topology,' ACM Sigcomm Computer Commun. Rev., 2001
  5. H. Tangmurankit, R. Govindan, S. Jamin, S. J. Shenker, and W. Willinger, 'Network topology generators: Degree-based vs. structural,' in Proc. ACM Sigcomm 2002, 2002
  6. B. Cheswick and H. Burch, 'Internet mapping project,' Wired Mag., Dec. 1998, available at http://cm.bell-labs.com/cm/cs/who/ches/map/index.html
  7. CAIDA Org., 'Skitter project,' http://www.caida.org/tools/measurement/skitter/
  8. L. Tauro, C. Palmer, G. Siganos, and M. Faloutsos, 'A simple conceptual model for the Internet topology,' in Proc. IEEE Global Internet 2001, 2001
  9. C. Palmer, G. Siganos, M. Faloutsos, C. Faloutsos, and P. Gibbons, 'The connectivity and fault-tolerance of the Internet topology,' in Proc. NRDM 2001, Santa Barbara, 2001
  10. J. Kleinberg, 'Authoritative sources in a hyperlinked environment,' J. ACM, 1999
  11. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in C. Cambridge University Press, 1992
  12. University of Oregon Route Views Project, 'Online data and reports,' http://www.routeviews.org/
  13. Q. Chen, H. Chang, R. Govindan, S. J. Scott, J. Shenker, and W. Willinger, 'The origin of power-laws in Internet topologies revisited,' in Proc. IEEE INFOCOM 2001, 2001
  14. L. Gao, 'On inferring automonous system relationships in the Internet,' IEEE/ACM Trans. Networking, vol. 9, no. 6, pp.733-745, 2001 https://doi.org/10.1109/90.974527
  15. Z. Ge, D. Figueiredo, S. Jaiswal, and L. Gao, 'On the hierarchical structure ofthe logical Internet graph,' in Proc. SPIE ITComm 2001, 2001
  16. R. Govindan and A. Reddy, 'An analysis oflnternet inter-domain topology and route stability,' in Proc. IEEE INFOCOM'97, 1997
  17. R. Albert, H. Jeong, and A. Barabasi, 'Attack and error tolerance of complex networks,' Nature, vol. 406, pp. 387-482, 2000
  18. H. Reittu and I. Norros, 'On the power-law random graph model of the Internet,' Tech. Report, VTT Information Technology, 2002
  19. R. Cohen and S. Havlin, 'Scale-free networks are ultrasmall,' Phys. Rev. Lett., vol. 90, no. 5, 2002
  20. M. Mihail and C. H. Papadimitriou, 'On the eigenvalue power-law,' Random,2002
  21. J. D. Noh, 'Exact scaling properties of a hierarchical network model,' Phys. Rev. E., 2003
  22. E. Ravasz and A.-L. Barabasi, 'Hierarchical organization in complex networks,' Phys. Rev. E. 2003
  23. F. Comellas, G. Fertin, and A. Raspaud, 'Vertex labeling and routing in recursive clique-trees, a new family of small-world scale-free graphs,' in Proc. Sirocco 2003, 2003
  24. W. W. Powell, D. R. White, K. W. Koput, and J. Owen-Smith, 'Network dynamics and field evolution: The growth of interorganizational collaboration in the life sciences,' American J. Sociology, vol. 110, no. 4, pp. 1132-1205, 2005 https://doi.org/10.1086/421508
  25. D. R. White, J. Owen-Smith, J. Moody, and W. W. Powell, 'Network dynamics and field evolution: The growth of interorganizational collaboration in the life sciences,' Computational and Mathematical Organization Theory, vol. 10, no. 1, pp. 95-117, 2004 https://doi.org/10.1023/B:CMOT.0000032581.34436.7b
  26. Y. Hyun, 'Walrus project,' http://mappa.mundi.net/maps/maps_020/, 2002
  27. B. M. Waxman, 'Routing of multipoint connections,' IEEE J. Select. Areas Commun., pp. 1617-1622, 1988
  28. M. Doar, 'A better model for generating test networks,' in Proc. IEEE Global Internet'96, 1996
  29. E. W. Zegura, K. L. Calvert, and M. J. Donahoo, 'A quantitative Com-parison of graph-based models for internetworks,' IEEE/ACM Trans. Networking, 1997
  30. A. Medina, I. Matta, and J. Byers, 'On the origin of powerlaws in Internet topologies,' ACM Sigcomm Computer Commun. Rev., 2000
  31. A. Barabasi and R. Albert, 'Emergence of scaling in random networks,' Science, vol. 286, pp. 509-512, 1999 https://doi.org/10.1126/science.286.5439.509
  32. W. Aiello, F. Chung, and L. Lu, 'A random graph model for massive graphs,' in Proc. STOC 2000, 2000, pp. 171-180
  33. T. Bu and D. Towsley, 'On distinguishing between Internet power-law topology generators,' in Proc. IEEE INFOCOM 2002, 2002
  34. A. Fabrikant, E. Koutsoupias, and C. H. Papadimitriou, 'Heuristically optimized trade-offs: A new paradigm for power-laws in the Internet,' in Proc. ICALP 2002, Springer-Verlag LNCS, pp.110-122
  35. R. Albert and A. Barabasi, 'Topology of complex networks: Local events and universality,' Phys. Rev. Lett., vol. 85, pp. 5234-5237, 2000 https://doi.org/10.1103/PhysRevLett.85.5234
  36. C. Jin, Q. Chen, and S. Jamin, 'Inet: Internet topology generator,' Tech. Report UM CSE-TR-433-00, 2000
  37. L. Subramanian, S. Agarwal, J. Rexford, and R. Katz, 'Characterizing the Internet hierarchy from multiple vantage points,' in Proc. IEEE INFOCOM 2002, 2002
  38. S. Bar, M. Gonen, and A. Wool, 'An incremental super-linear preferential Internet topology model,' in Proc. PAM 2004, 2004
  39. G. Huston, http://www.telstra.net/gih, 2001
  40. A. Medina, A. Lakhina, I. Matta, and J. Byers, 'BRITE: Topology generator,' http://www.cs.bu.edu/brite/