Power laws and the AS-level Internet topology

被引:254
作者
Siganos, G [1 ]
Faloutsos, M
Faloutsos, P
Faloutsos, C
机构
[1] Univ Calif Riverside, Dept Comp Sci, Riverside, CA 92521 USA
[2] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90095 USA
[3] Carnegie Mellon Univ, Dept Comp Sci, Pittsburgh, PA 15213 USA
基金
美国国家科学基金会;
关键词
network modeling; power laws;
D O I
10.1109/TNET.2003.815300
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we study and characterize the topology of the Internet at the autonomous system (AS) level. First, we show that the topology can be described efficiently with power laws. The elegance and simplicity of the power laws provide a novel perspective into the seemingly. uncontrolled Internet structure. Second, we show that power laws have appeared consistently over the last five years. We also observe that the power laws hold even in the most recent and more complete topology with correlation coefficient above 99% for the degree-based power law. In addition, we study the evolution of the power-law exponents over the five-year interval and observe a variation for the degree-based power law of less than 10%. Third, we provide relationships between the exponents and other topological metrics.
引用
收藏
页码:514 / 524
页数:11
相关论文
共 60 条
[1]  
Adamic LA, 2000, ZIPF POWER LAWS PARE
[2]  
Aiello W., 2000, Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, P171, DOI 10.1145/335305.335326
[3]   Topology of evolving networks:: Local events and universality [J].
Albert, R ;
Barabási, AL .
PHYSICAL REVIEW LETTERS, 2000, 85 (24) :5234-5237
[4]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[5]   Internet -: Diameter of the World-Wide Web [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 1999, 401 (6749) :130-131
[6]  
[Anonymous], P 19 ACM SIGMOD SIGA
[7]  
[Anonymous], 1949, Human behaviour and the principle of least-effort
[8]  
Bak P. P., 1996, NATURE WORKS
[9]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[10]  
Bu T, 2002, IEEE INFOCOM SER, P638, DOI 10.1109/INFCOM.2002.1019309