The "robust yet fragile" nature of the Internet

被引:272
作者
Doyle, JC [1 ]
Alderson, DL
Li, L
Low, S
Roughan, M
Shalunov, S
Tanaka, R
Willinger, W
机构
[1] CALTECH, Div Engn & Appl Sci, Pasadena, CA 91125 USA
[2] Univ Adelaide, Adelaide, SA 5005, Australia
[3] Internet2, Ann Arbor, MI 48108 USA
[4] BioMomet Control Res Ctr, Inst Phys & Chem Res, Nagoya, Aichi 4630003, Japan
[5] AT&T Labs Res, Florham Pk, NJ 07932 USA
关键词
complex network; HOT; Internet topology; network design; scale-free network;
D O I
10.1073/pnas.0501426102
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
The search for unifying properties of complex networks is popular, challenging, and important. For modeling approaches that focus on robustness and fragility as unifying concepts, the Internet is an especially attractive case study, mainly because its applications are ubiquitous and pervasive, and widely available expositions exist at every level of detail. Nevertheless, alternative approaches to modeling the Internet often make extremely different assumptions and derive opposite conclusions about fundamental properties of one and the same system. Fortunately, a detailed understanding of Internet technology combined with a unique ability to measure the network means that these differences can be understood thoroughly and resolved unambiguously. This article aims to make recent results of this process accessible beyond Internet specialists to the broader scientific community and to clarify several sources of basic methodological differences that are relevant beyond either the Internet or the two specific approaches focused on here (i.e., scale-free networks and highly optimized tolerance networks).
引用
收藏
页码:14497 / 14502
页数:6
相关论文
共 31 条
[1]  
Aiello W., 2000, Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, P171, DOI 10.1145/335305.335326
[2]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[3]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[4]  
ALDERSON D, 2004, CITCDS04004
[5]  
BANK D, 2005, WALL STREET J, P1
[6]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[7]  
Bollobas B, 2003, INTERNET MATH, V1, P1, DOI DOI 10.1080/15427951.2004.10129080
[8]   Complexity and robustness [J].
Carlson, JM ;
Doyle, J .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2002, 99 :2538-2545
[9]  
Chung F., 2004, Internet Math., V1, P91, DOI 10.1080/15427951.2004.10129081
[10]  
CLARK DD, 1988, COMPUT COMMUN REV, V18, P106, DOI DOI 10.1145/52325.52336