Browse > Article

Network Topology Generation Algorithms Reflecting Internet Evolution  

조인숙 (숭실대학교 대학원 컴퓨터학과)
김병기 (숭실대학교 정보과학대학 컴퓨터학부)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.28, no.10B, 2003 , pp. 938-946 More about this Journal
Abstract
Studies of Internet algorithms or policies require experiments on the real large-scale networks. But practical problems with large real networks make them difficult. Instead many researchers use simulations on the Internet topology models. Some tried to find out abstract topological properties of Internet. And several models are proposed to reflect Internet's topological characteristics better. But few studies have been performed on how to model the evolution of Internet. We propose algorithms for modeling addition and removal of nodes and accompanied change of topologies. We analyze the topologies generated by our algorithms to observe that they obey the power-laws better than those generated by existing ones. These algorithms are also expected to be helpful in predicting future topologies of Internet.
Keywords
Power-law; Internet; Topology Model; Evolution; Power-law;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. Doar, 'A Better Model for Generating TestNetworks,' In Proceedings of IEEEGLOBECOM, November, pp. 86-93, 1996
2 B. M. Waxman, 'Routing of Multipoint Connections,' IEEE Journal on Selected Areasin Communications, Vol. 6, No. 9, pp.1617-1622, December 1998
3 A. Medina, A. Lakhina, I. Matta and J. Byers,'BRITE: An Approach to Universal TopologyGeneration,' In Proceedings of MASCOTS 2001,pp. 346-353, August 2001
4 C. Jin, Q. Chen, and S. Jamin, 'Inet: InternetTopoloey Generato,' Technical Report ResearchReport CSE-TR-433-00, University of Michiganat Ann Arbor, 2000
5 E. Zegura, K. Calvert, and S. Bhattacharjee,'How to model an Internetwork,' In Proceedings of IEEE INFOCOM, Vol. 2, pp.594-602, April 1996   DOI
6 A. Medina, A. Lakhina, I. Matta, and J. Byers,'BRITE: Universal Tonology Ceneration from aUsers Perspective,' Technical ReportBUCS-TR- 2001-003, Boston University, 2001Available at http://www.cs.bu.edu/brite/publications
7 K. L. Albert, M. B. Doar and E. W.Zegura, 'Modeling Internet Topologvy,' IEEECommunications Magazine, Vol. 35, No. 6, pp.160-163, June 1997   DOI   ScienceOn
8 A. L. Barabasi, R. Albert, and Hawoong Jeong,'Scale-free characteristics of random networks:the topology of the WWW,' Physica A, Vol. 28,No. 1, pp. 69-77, 2000
9 A. Medina, I. Matta, and J. Byers, 'On theOrigin of Power Laws in Internet Topologies,'Computer Communication Review, Vol. 30, No.2, pp.l8-28, 2000
10 A. L. Barabasi and R. Albert, 'Emergence ofScaling in Random Network,' Science, Vol. 286,pp. 509-512, October 1999   DOI   PUBMED   ScienceOn
11 W. Aiello, F. Chung and L. Lu, 'A RandomGraph Model for Massive Graphs,' InProceedings of the Thirty-Second Annual ACMSymposium on Theory of Computing pp.171-180, 2000
12 A. L. Barabasi, R. Albert, and Hawoong Jeong,'Mean-field theory for scale-free randomnetworks,' Physica A, Vol 272, pp. 173-187,1999   DOI   ScienceOn
13 M. Faloutsos, P. Faloutsos, and C. Faloutso, 'OnPower-Law Relationships of the InternetTopology,' In ACM Computer CommunicationReview, pp. 251-261, September 1999