Cascading failure model of scale-free networks for avoiding edge failure

2019 ◽  
Vol 12 (6) ◽  
pp. 1627-1637 ◽  
Author(s):  
Jinlong Ma ◽  
Zhichao Ju
Keyword(s):  
Cascading Failure ◽  
Failure Model ◽  
Scale Free ◽  
Scale Free Networks ◽  
Edge Failure

Cascading failure model for the mitigating edge failure of scale-free networks

Pramana ◽  
2019 ◽  
Vol 92 (4) ◽  
Author(s):  
Zhichao Ju ◽  
Jinlong Ma ◽  
Jianjun Xie ◽  
Yanpeng Wang ◽  
Huimin Cui ◽  
...  
Keyword(s):  
Cascading Failure ◽  
Failure Model ◽  
Scale Free ◽  
Scale Free Networks ◽  
Edge Failure

Cascading failure model for improving the robustness of scale-free networks

2018 ◽  
Vol 29 (06) ◽  
pp. 1850044 ◽  
Author(s):  
Zhichao Ju ◽  
Jinlong Ma ◽  
Jianjun Xie ◽  
Zhaohui Qi
Keyword(s):  
Real Life ◽  
Cascading Failure ◽  
Edge Weight ◽  
Failure Model ◽  
Threshold Parameter ◽  
Connected Component ◽  
New Model ◽  
Scale Free ◽  
Small Load ◽  
Scale Free Networks

To control the spread of cascading failure on scale-free networks, we propose a new model with the betweenness centrality and the degrees of the nodes which are combined. The effects of the parameters of the edge weight on cascading dynamics are investigated. Five metrics to evaluate the robustness of the network are given: the threshold parameter ([Formula: see text]), the proportion of collapsed edges ([Formula: see text]), the proportion of collapsed nodes ([Formula: see text]), the number of nodes in the largest connected component ([Formula: see text]) and the number of the connected component ([Formula: see text]). Compared with the degrees of nodes’ model and the betweenness of the nodes’ model, the new model could control the spread of cascading failure more significantly. This work might be helpful for preventing and mitigating cascading failure in real life, especially for small load networks.

Dynamics of load entropy during cascading failure propagation in scale-free networks

2008 ◽  
Vol 372 (36) ◽  
pp. 5778-5782 ◽  
Author(s):  
Z.J. Bao ◽  
Y.J. Cao ◽  
L.J. Ding ◽  
Z.X. Han ◽  
G.Z. Wang
Keyword(s):  
Cascading Failure ◽  
Scale Free ◽  
Scale Free Networks ◽  
Failure Propagation

Cascading failure in the wireless sensor scale-free networks

2015 ◽  
Vol 24 (5) ◽  
pp. 050506 ◽  
Author(s):  
Hao-Ran Liu ◽  
Ming-Ru Dong ◽  
Rong-Rong Yin ◽  
Li Han
Keyword(s):  
Wireless Sensor ◽  
Cascading Failure ◽  
Scale Free ◽  
Scale Free Networks

VULNERABILITY OF EFFECTIVE ATTACK ON EDGES IN SCALE-FREE NETWORKS DUE TO CASCADING FAILURES

2009 ◽  
Vol 20 (08) ◽  
pp. 1291-1298 ◽  
Author(s):  
JIAN-WEI WANG ◽  
LI-LI RONG
Keyword(s):  
Theoretical Prediction ◽  
Numerical Simulations ◽  
Real Life ◽  
Network Robustness ◽  
Critical Threshold ◽  
Cascading Failure ◽  
Cascading Failures ◽  
Scale Free ◽  
Scale Free Networks ◽  
Initial Load

Assume the initial load of an edge ij in a network to be Lij =[(ki ∑a ∈ Γi ka)(kj ∑b ∈ Γj kb)]α with ki and kj being the degrees of the nodes connected by the edge, where α is a tunable parameter which controls the strength of the edge initial load, and Γi and Γj are the sets of neighboring nodes of i and j, respectively. We investigate the cascading phenomenon of uncorrelated scale-free networks subject to two different attacking strategies on edges, i.e. attacking on the edges with the highest loads or the lowest loads (LL). By the critical threshold of edge capacity quantifying the network robustness, we numerically discuss the effects of two attacks for the network vulnerability. Interestingly, it is found that the attack on the edge with the LL is highly effective in disrupting the structure of the attacked network when α < 0.5. In the case of α = 0.5, the effects of two attacks for the network robustness against cascading failures are almost identical. We furthermore provide the theoretical prediction support for the numerical simulations. These results may be very helpful for real-life networks to protect the key edges selected effectively to avoid cascading-failure-induced disasters.

A NEW ATTACK ON SCALE-FREE NETWORKS BASED ON CASCADING FAILURES

2009 ◽  
Vol 23 (20n21) ◽  
pp. 2497-2505 ◽  
Author(s):  
KAI YU ◽  
LILI RONG ◽  
JIANWEI WANG
Keyword(s):  
Real Life ◽  
Local Information ◽  
Average Degree ◽  
Cascading Failure ◽  
Cascading Failures ◽  
Scale Free ◽  
Scale Free Networks ◽  
Key Nodes ◽  
Attack Strategy

In this paper, based on the local information about nodes, we propose a new attack strategy, considering the average degree of the node's neighboring nodes. Adopting the cascading model proposed in Chin. Phys. Lett.25(10) (2008) 3826, we investigate the effect of the new attack strategy for the robustness against cascading failures on a typical network, i.e. BA scale-free networks. Compared with two attacks on the nodes with the highest load or the lowest load, numerically we find that our presented attack is the most efficient way to destruct the BA scale-free networks in the case of α ≤ 0.6, where α is a tunable parameter and determines to the load strength of a node. In addition, we also find that the efficiency of the new attack strategy is more obvious near the parameter α = 0.5. We expect our findings to provide insights into the protection of the key nodes for real-life networks to avoid cascading-failure-induced disasters.

Sign in / Sign up

Export Citation Format

Share Document