DocumentCode :
1974218
Title :
On distinguishing between Internet power law topology generators
Author :
Bu, Tian ; Towsley, Don
Author_Institution :
Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA
Volume :
2
fYear :
2002
fDate :
2002
Firstpage :
638
Abstract :
Recent work has shown that the node degree in the WWW induced graph and the autonomous system (AS) level Internet topology exhibit power laws. Since then, several algorithms have been proposed to generate such power law graphs. We evaluate the effectiveness of these generators to generate representative AS-level topologies. Our conclusions are mixed. Although they (mostly) do a reasonable job at capturing the power law exponent, they do less well in capturing the clustering phenomena exhibited by the Internet topology. Based on these results, we propose a variation of the recent incremental topology generator of R. Albert and A. Barabasi (see Phys. Rev. Letters, vol.85, p.5234-7, 2000) that is more successful at matching the power law exponent and the clustering behavior of the Internet. Last, we comment on the small world behavior of the Internet topology.
Keywords :
Internet; graph theory; network topology; Internet topology; WWW induced graph; clustering phenomena; node degree; power law graphs; power law topology generators; Algorithm design and analysis; Clustering algorithms; Computer science; Convergence; Internet; Network topology; Power generation; Protocols; Web sites; World Wide Web;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
ISSN :
0743-166X
Print_ISBN :
0-7803-7476-2
Type :
conf
DOI :
10.1109/INFCOM.2002.1019309
Filename :
1019309
Link To Document :
بازگشت