Optimal weighting scheme for suppressing cascades and traffic congestion in complex networks
- 27 February 2009
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 79 (2), 026112
- https://doi.org/10.1103/physreve.79.026112
Abstract
This paper is motivated by the following two related problems in complex networks: (i) control of cascading failures and (ii) mitigation of traffic congestion. Both problems are of significant recent interest as they address, respectively, the security of and efficient information transmission on complex networks. Taking into account typical features of load distribution and weights in real-world networks, we have discovered an optimal solution to both problems. In particular, we shall provide numerical evidence and theoretical analysis that, by choosing a proper weighting parameter, a maximum level of robustness against cascades and traffic congestion can be achieved, which practically rids the network of occurrences of the catastrophic dynamics.Keywords
This publication has 24 references indexed in Scilit:
- Understanding and preventing cascading breakdown in complex clustered networksPhysical Review E, 2008
- Tolerance of scale-free networks against attack-induced cascadesPhysical Review E, 2005
- Attack vulnerability of scale-free networks due to cascading breakdownPhysical Review E, 2004
- Cascade Control and Defense in Complex NetworksPhysical Review Letters, 2004
- Model for cascading failures in complex networksPhysical Review E, 2004
- Cascade-based attacks on complex networksPhysical Review E, 2002
- Dynamical properties of model communication networksPhysical Review E, 2002
- Error and attack tolerance of complex networksNature, 2000
- Disturbances in a power transmission systemPhysical Review E, 2000
- Congestion avoidance and controlACM SIGCOMM Computer Communication Review, 1988