Cascade-based attacks on complex networks.
@article{Motter2002CascadebasedAO, title={Cascade-based attacks on complex networks.}, author={Adilson E. Motter and Ying-Cheng Lai}, journal={Physical review. E, Statistical, nonlinear, and soft matter physics}, year={2002}, volume={66 6 Pt 2}, pages={ 065102 } }
We live in a modern world supported by large, complex networks. Examples range from financial markets to communication and transportation systems. In many realistic situations the flow of physical quantities in the network, as characterized by the loads on nodes, is important. We show that for such networks where loads can redistribute among the nodes, intentional attacks can lead to a cascade of overload failures, which can in turn cause the entire or a substantial part of the network to…
1,495 Citations
Attacks and cascades in weighted scale-free networks
- Computer ScienceIEEE Conference Anthology
- 2013
A nonlinear load-capacity model for cascading failures based on the dynamical redistribution of the flow on the network is proposed and it is shown that the entire network may collapse for the breakdown of a single node of the entirenetwork if the node is among the ones with highest loads.
Bottleneck Attack Strategies on Complex Communication Networks
- Computer ScienceICIC
- 2010
Simulation results indicate that hub-bottlenecks, rather than hub-nonbottlenECks, are most important in all networks, and bottleneck nodes represent the fragility of modular scale-free networks.
Attacks and cascades in complex networks
- Computer Science
- 2004
The investigation of a mechanism leading to cascades of overload failures in complex networks by constructing a simple model incorporating the flow of physical quantities in the network leads to the finding that many scale-free networks are more sensitive to attacks on short-range than on long-range links.
Attack Vulnerability of Complex Communication Networks
- Computer ScienceIEEE Transactions on Circuits and Systems II: Express Briefs
- 2008
Compared with the classic random graph and scale-free network models, the congestion control protocols are considered so that the bandwidth can be reallocated among flows and cascading breakdown is less likely to happen.
Robustness and Security of Router-level Internet and Complex Networks Examples under Hybrid Networks Attacks
- Computer Science
- 2016
For a better predicting and analyses of robustness and security properties of some networks examples such as scale-free networks, small-world networks and real-world router-level Internet, models…
Robustness of Internet under targeted attack: A cascading failure perspective
- Computer ScienceJ. Netw. Comput. Appl.
- 2014
Inhibiting failure spreading in complex networks
- Computer Science
- 2020
This article rigorously proves the existence of certain subgraphs, called network isolators, that can completely inhibit any failure spreading, and shows how to create such isolators in synthetic and real-world networks.
Cascading Critical Nodes Detection with Load Redistribution in Complex Systems
- Computer ScienceCOCOA
- 2014
The first approach estimates the cascading potential of each node while the second one measures the cooperated impact of node failures under an ordered attack to solve the problem of complex network vulnerability under cascading failure.
Identifying Vulnerable Nodes of Complex Networks in Cascading Failures Induced by Node-Based Attacks
- Computer Science
- 2013
This work probes how to identify the vulnerable nodes of complex networks in cascading failures, which was ignored before, and introduces four kinds of weighting methods to characterize the nodes of networks including Barabasi-Albert scale-free networks (SF), Watts-Strogatz small-world networks (WS), Erdos-Renyi random networks (ER), and two real-world Networks.
References
SHOWING 1-10 OF 39 REFERENCES
Small worlds: the dynamics of networks between order and randomness
- Computer ScienceSGMD
- 2002
Duncan Watts uses the small-world phenomenon--colloquially called "six degrees of separation"--as a prelude to a more general exploration: under what conditions can a small world arise in any kind of network?
Book Review: Small Worlds. The Dynamics of Networks Between Order and Randomness
- Art
- 1999
The container is configured to achieve stacking interchangeability when any horizontally peripheral sides are aligned and brackets are disposed around the vertical periphery of the container to achieve fork lift accessibility from any direction perpendicular to the vertically peripheral sides.
Nature (London ) 406
- 378
- 2000
Phys
- Rev. Lett. 88, 108701
- 2002
Ph ys
- Rev. Lett. 87, 258701
- 2001
Comput
- Commun. Rev. 18, 314
- 1988
Phys. Rev. Lett
- Phys. Rev. Lett
Phys
- Rev. E 66, 065103
- 2002
Phys. Rev. Lett
- Phys. Rev. Lett