Cascading Dynamics of Heterogenous Scale-Free Networks with Recovery Mechanism

Abstract

In network security, how to use efficient response methods against cascading failures of complex networks is very important. In this paper, concerned with the highest-load attack (HL) and random attack (RA) on one edge, we define five kinds of weighting strategies to assign the external resources for recovering the edges from cascading failures in heterogeneous scale-free (SF) networks. The influence of external resources, the tolerance parameter, and the different weighting strategies on SF networks against cascading failures is investigated carefully. We find that, under HL attack, the fourth kind of weighting method can more effectively improve the integral robustness of SF networks, simultaneously control the spreading velocity, and control the outburst of cascading failures in SF networks than other methods. Moreover, the third method is optimal if we only knew the local structure of SF networks and the uniform assignment is the worst. The simulations of the real-world autonomous system in, Internet have also supported our findings. The results are useful for using efficient response strategy against the emergent accidents and controlling the cascading failures in the real-world networks.

Topology Identification of Coupling Map Lattice under Sparsity Condition

“…The coupled map lattice with nonlocally coupling chaotic characteristic is widely observed and highly involved in many fields, which ranges from complex network [1][2][3] to neural network, from biological system to ecological system, and from physics to computer science [4][5][6]. Driven by some practical applications which benefit from the better controlling of CML, a great deal of current research of CML has focused on dynamical analysis, control, and modeling.…”