https://doi.org/10.1140/epjb/e2009-00004-0
Cascading dynamics in congested complex networks
1
College of Computer Science and Technology, Jilin University, Changchun, 130012, P.R. China
2
Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun, 130012, P.R. China
Corresponding author: a lyh_lb_lk@yahoo.com.cn
Received:
23
May
2008
Revised:
7
October
2008
Published online:
9
January
2009
Cascading failures often occur in congested complex networks. Cascading failures can be expressed as a three phase process: generation, diffusion and dissipation of congestion. Different from betweenness centrality, we propose a congestion function to represent the extent of congestion on a given node. By introducing the concept of “delay time”, we construct an intergradation between permanent removal and nonremoval. We also build a new evaluation function of network efficiency, based on congestion, which measures the damage caused by cascading failures. Finally, based on Statnet and Webgraph topologies we investigate the effects of network structure and size, delay time, processing ability and traffic generation speed on congestion propagation. Also we uncover cascading process composed of three phases and some factors affecting cascade propagation.
PACS: 89.75.-k – Complex systems / 89.75.Da – Systems obeying scaling laws / 02.60.Cb – Numerical simulation; solution of equations
© EDP Sciences, Società Italiana di Fisica, Springer-Verlag, 2009