A first-principles approach to understanding the Internet's router-level topology

被引:134
作者
Li, L [1 ]
Alderson, D [1 ]
Willinger, W [1 ]
Doyle, J [1 ]
机构
[1] CALTECH, Pasadena, CA 91125 USA
关键词
network topology; degree-based generators; topology metrics; heuristically optimal topology;
D O I
10.1145/1030194.1015470
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A detailed understanding of the many facets of the Internet's topological structure is critical for evaluating the performance of networking protocols, for assessing the effectiveness of proposed techniques to protect the network from nefarious intrusions and attacks, or for developing improved designs for resource provisioning. Previous studies of topology have focused on interpreting measurements or on phenomenological descriptions and evaluation of graph-theoretic properties of topology generators. We propose a complementary approach of combining a more subtle use of statistics and graph theory with a first-principles theory of router-level topology that reflects practical constraints and tradeoffs. While there is an inevitable tradeoff between model complexity and fidelity, a challenge is to distill from the seemingly endless list of potentially relevant technological and economic issues the features that are most essential to a solid understanding of the intrinsic fundamentals of network topology. We claim that very simple models that incorporate hard technological constraints on router and link bandwidth and connectivity, together with abstract models of user demand and network performance, can successfully address this challenge and further resolve much of the confusion and controversy that has surrounded topology generation and evaluation.
引用
收藏
页码:3 / 14
页数:12
相关论文
共 46 条
[1]  
*AB NETW, DET INF OBJ ORG DEV
[2]  
AIELLO W, P STOC 2000
[3]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[4]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[5]  
ALDERSON D, 2003, ACM SIGCOMM COMPUTER
[6]  
ALDERSON D, 2004, CITCDS04004 CALTECH
[7]  
[Anonymous], P MASCOTS 01 AUG
[8]  
[Anonymous], ACM SIGCOMM COMPUTER
[9]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[10]  
Bollobas B, 2003, INTERNET MATH, V1, P1, DOI DOI 10.1080/15427951.2004.10129080