Breakdown of the internet under intentional attack.

  title={Breakdown of the internet under intentional attack.},
  author={Reuven Cohen and Keren Erez and Daniel ben-Avraham and Shlomo Havlin},
  journal={Physical review letters},
  volume={86 16},
We study the tolerance of random networks to intentional attack, whereby a fraction p of the most connected sites is removed. We focus on scale-free networks, having connectivity distribution P(k) approximately k(-alpha), and use percolation theory to study analytically and numerically the critical fraction p(c) needed for the disintegration of the network, as well as the size of the largest connected cluster. We find that even networks with alpha < or = 3, known to be resilient to random… Expand

Figures and Topics from this paper

Tolerance of scale-free networks: from friendly to intentional attack strategies
We study the tolerance of a scale-free network (having a connectivity distribution P(k)∼k−γ) under systematic variation of the attack strategy. In an attack, the probability that a given node isExpand
Scale-free networks resistant to intentional attacks
We study the detailed mechanism of the failure of scale-free networks under intentional attacks. Although it is generally accepted that such networks are very sensitive to targeted attacks, we showExpand
Optimization of Robustness of Scale-Free Network to Random and Targeted Attacks
It is found that when = 3 the robustness of the scale-free networks reach its maximum value if the minimal connectivity m = 1, but when is larger than four, the networks will become more robust to random failures and targeted attacks as the minimal connection m gets larger. Expand
Stability and topology of scale-free networks under attack and defense strategies.
It is found that, for an intentional attack, little knowledge of the well-connected sites is sufficient to strongly reduce p(c), and at criticality, the topology of the network depends on the removal strategy, implying that different strategies may lead to different kinds of percolation transitions. Expand
Parameters Affecting the Resilience of Scale-Free Networks to Random Failures
It is shown that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9. Expand
Tearing down the Internet
  • D. Magoni
  • Computer Science
  • IEEE J. Sel. Areas Commun.
  • 2003
It is shown that although the removal of a small fraction of nodes can damage the Internet connectivity, such a node removal attack would still require a large amount of work to be carried out. Expand
Comparison of Failures and Attacks on Random and Scale-Free Networks
This paper moderate the general affirmation that scale-free networks are much more sensitive than random networks to attacks by showing that the number of links to remove in both cases is similar, and by shows that a slightly modified scenario for failures gives results similar to the ones for attacks. Expand
Percolation of localized attack on complex networks
A percolation framework to analytically and numerically study the robustness of complex networks against localized attack in Erd\H{o}s-R\'{e}nyi networks, random-regular networks, and scale-free networks is developed. Expand
Vulnerability of complex networks under intentional attack with incomplete information
We study the vulnerability of complex networks under intentional attack with incomplete information, which means that one can only preferentially attack the most important nodes among a local regionExpand
On Certain Behavior of Scale-Free Networks Under Malicious Attacks
This paper evaluates performance of scale-free networks in case of intentional removal of their nodes and proposes the new ones: mean maximum flow, centre of gravity of node degree distribution and other for the first time. Expand


Nature (London) 406
  • 6794 (2000); 406, 378
  • 2000
  • Rev. Lett. 85, 5468
  • 2000
ACM SIGCOMM ’99 Comput
  • Commun. Rev. 29, 251
  • 1999
  • Probab. Comput. 7, 295
  • 1998
Random Struct
  • Algorithms 6, 161
  • 1995
Random Graphs