Complex networks: Dynamics and security

This paper presents a perspective in the study of complex networks by focusing on how dynamics may affect network security under attacks. In particular, we review two related problems: attack-induced cascading breakdown and range-based attacks on links. A cascade in a network means the failure of a substantial fraction of the entire network in a cascading manner, which can be induced by the failure of or attacks on only a few nodes. These have been reported for the internet and for the power grid (e.g., the August 10, 1996 failure of the western United States power grid). We study a mechanism for cascades in complex networks by constructing a model incorporating the flows of information and physical quantities in the network. Using this model we can also show that the cascading phenomenon can be understood as a phase transition in terms of the key parameter characterizing the node capacity. For a parameter value below the phase-transition point, cascading failures can cause the network to disintegrate almost entirely. We will show how to obtain a theoretical estimate for the phase-transition point. The second problem is motivated by the fact that most existing works on the security of complex networks consider attacks on nodes rather than on links. We address attacks on links. Our investigation leads to the finding that many scale-free networks are more sensitive to attacks on short-range than on long-range links. Considering that the small-world phenomenon in complex networks has been identified as being due to the presence of long-range links, i.e., links connecting nodes that would otherwise be separated by a long node-to-node distance, our result, besides its importance concerning network efficiency and security, has the striking implication that the small-world property of scale-free networks is mainly due to short-range links.

[1]  Gesine Reinert,et al.  Small worlds , 2001, Random Struct. Algorithms.

[2]  K-I Goh,et al.  Fluctuation-driven dynamics of the internet topology. , 2002, Physical review letters.

[3]  R Pastor-Satorras,et al.  Dynamical and correlation properties of the internet. , 2001, Physical review letters.

[4]  Ricard V. Solé,et al.  Complexity and fragility in ecological networks , 2000, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[5]  S. Redner How popular is your paper? An empirical study of the citation distribution , 1998, cond-mat/9804163.

[6]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

[7]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[9]  Walter Willinger,et al.  Scaling phenomena in the Internet: Critically examining criticality , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[10]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[11]  Ralph H. Sprague,et al.  Proceedings of the Thirty-Third Annual Hawaii International Conference on System Sciences, January 4-7, 2000, Maui, Hawaii : Abstracts and CD-ROM of Full Papers , 2000 .

[12]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[13]  Duncan J Watts,et al.  A simple model of global cascades on random networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[14]  Béla Bollobás,et al.  Random Graphs , 1985 .

[15]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[16]  Y. Moreno,et al.  Instability of scale-free networks under node-breaking avalanches , 2001 .

[17]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[18]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

[19]  L. Amaral,et al.  The web of human sexual contacts , 2001, Nature.

[20]  S. Strogatz Exploring complex networks , 2001, Nature.

[21]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[22]  Donald Kennedy Science, Terrorism, and Natural Disasters , 2002, Science.

[23]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[24]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[25]  M. L. Sachtjen,et al.  Disturbances in a power transmission system , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[26]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[27]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[28]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[29]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[30]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.