scholarly journals Cascading failures in scale-free interdependent networks

2019 ◽  
Vol 99 (3) ◽  
Author(s):  
Malgorzata Turalska ◽  
Keith Burghardt ◽  
Martin Rohden ◽  
Ananthram Swami ◽  
Raissa M. D'Souza
Keyword(s):  
Cascading Failures ◽  
Scale Free ◽  
Interdependent Networks

Cascading failures in interdependent modular networks with partial random coupling preference

2017 ◽  
Vol 31 (29) ◽  
pp. 1750267 ◽  
Author(s):  
Meng Tian ◽  
Xianpei Wang ◽  
Zhengcheng Dong ◽  
Guowei Zhu ◽  
Jiachuang Long ◽  
...  
Keyword(s):  
Community Structure ◽  
Network Robustness ◽  
Cascading Failures ◽  
Scale Free ◽  
Interdependent Networks ◽  
Connection Probability ◽  
Random Coupling ◽  
Protection Cost ◽  
Interdependent Infrastructures ◽  
Partial Coupling

Cascading failures have been widely analyzed in interdependent networks with different coupling preferences from microscopic and macroscopic perspectives in recent years. Plenty of real-world interdependent infrastructures, representing as interdependent networks, exhibit community structure, one of the most important mesoscopic structures, and partial coupling preferences, which can affect cascading failures in interdependent networks. In this paper, we propose the partial random coupling in communities, investigating cascading failures in interdependent modular scale-free networks under inner attacks and hub attacks. We mainly analyze the effects of the discoupling probability and the intermodular connection probability on cascading failures in interdependent networks. We find that increasing either the dicoupling probability or the intermodular connection probability can enhance the network robustness under both hub attacks and inner attacks. We also note that the community structure can prevent cascading failures spreading globally in entire interdependent networks. Finally, we obtain the result that if we want to efficiently improve the robustness of interdependent networks and reduce the protection cost, the intermodular connection probability should be protected preferentially, implying that improving the robustness of a single network is the fundamental method to enhance the robustness of the entire interdependent networks.

The influence of the depth of k-core layers on the robustness of interdependent networks against cascading failures

2017 ◽  
Vol 28 (02) ◽  
pp. 1750020 ◽  
Author(s):  
Zhengcheng Dong ◽  
Yanjun Fang ◽  
Meng Tian ◽  
Zhengmin Kong
Keyword(s):  
Preferential Attachment ◽  
Core Layer ◽  
Cascading Failures ◽  
Scale Free ◽  
Interdependent Networks ◽  
The Core ◽  
Initial Load ◽  
The Hierarchical Structure ◽  
Free Network ◽  
Structure Formula

The hierarchical structure, [Formula: see text]-core, is common in various complex networks, and the actual network always has successive layers from 1-core layer (the peripheral layer) to [Formula: see text]-core layer (the core layer). The nodes within the core layer have been proved to be the most influential spreaders, but there is few work about how the depth of [Formula: see text]-core layers (the value of [Formula: see text]) can affect the robustness against cascading failures, rather than the interdependent networks. First, following the preferential attachment, a novel method is proposed to generate the scale-free network with successive [Formula: see text]-core layers (KCBA network), and the KCBA network is validated more realistic than the traditional BA network. Then, with KCBA interdependent networks, the effect of the depth of [Formula: see text]-core layers is investigated. Considering the load-based model, the loss of capacity on nodes is adopted to quantify the robustness instead of the number of functional nodes in the end. We conduct two attacking strategies, i.e. the RO-attack (Randomly remove only one node) and the RF-attack (Randomly remove a fraction of nodes). Results show that the robustness of KCBA networks not only depends on the depth of [Formula: see text]-core layers, but also is slightly influenced by the initial load. With RO-attack, the networks with less [Formula: see text]-core layers are more robust when the initial load is small. With RF-attack, the robustness improves with small [Formula: see text], but the improvement is getting weaker with the increment of the initial load. In a word, the lower the depth is, the more robust the networks will be.

Cascading Failures in Two-Layered Interdependent Scale-Free Networks

2013 ◽  
Vol 419 ◽  
pp. 918-924
Author(s):  
Xing Zhao Peng ◽  
Hong Yao ◽  
Jun Du ◽  
Chao Ding ◽  
Zhi Hao Zhang
Keyword(s):  
Average Degree ◽  
Cascading Failures ◽  
Failure Model ◽  
Cascading Effects ◽  
Scale Free ◽  
Interdependent Networks ◽  
The Past ◽  
Interdependent Network ◽  
Scale Free Networks ◽  
Random Failures

Cascading failures in isolated networks have been widely studied in the past decade, cascading failures in interdependent networks are attracting more and more attention recently, but previous studies focus on the interdependent networks topological cascading effects, neglecting the loads which present in most real networks. Considering the effect of loads, the two-layered interdependent BA network model and the cascading failure model were reestablished in this paper, based on these, the robustness of interdependent networks under random failures and intentional attacks and the effects of average degree on the suppressing of cascading failures were researched. The simulation results show that compared to random failures, interdependent network is more vulnerable under intentional attacks; the network in coupled state is more vulnerable than in isolated state under random failures, while therere no obvious differences under intentional attacks; the network performs more robust to resist cascading failures if each layer network of the interdependent network hold larger average degree.

Cascading failures of interdependent networks with different k-core structures

2017 ◽  
Vol 31 (10) ◽  
pp. 1750112 ◽  
Author(s):  
Zhengcheng Dong ◽  
Yanjun Fang ◽  
Meng Tian
Keyword(s):  
Real Life ◽  
Network Evolution ◽  
Cascading Failures ◽  
Scale Free Network ◽  
Scale Free ◽  
Interdependent Networks ◽  
Mesoscale Structures ◽  
Initial Load ◽  
Free Network ◽  
Random Coupling

As one of the most common mesoscale structures in real-life networks, k-core hierarchical structure has attracted a lot of attention. Recent research about k-core always focuses on detecting influential nodes determining failure or epidemic propagation. However, few studies have attempted to understand how k-core structural properties can affect dynamic characteristics of network. In this paper, the influences of depth and coupling preferences of k-core on the cascading failures of interdependent scale-free networks are investigated. First, k-core structures of some real-life networks are analyzed, and a scale-free network evolution model with rich and successive k-core layers is proposed. Then, based on a load-based cascading model, the influence of the depth of k-core is investigated with a new evaluation index. In the end, two coupling preferences are analyzed, i.e. random coupling (RC) and assortative coupling (AC). Results show that the lower the depth is, the more robust the interdependent networks will be, and we find AC and RC perform dissimilarly when the capacity varies. Furthermore, all the effects will be affected by the initial load.

scholarly journals Greedy control of cascading failures in interdependent networks

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Malgorzata Turalska ◽  
Ananthram Swami
Keyword(s):  
Optimal Control ◽  
Complex Systems ◽  
Control Strategy ◽  
Cascading Failures ◽  
Optimal Control Strategy ◽  
Supercritical Regime ◽  
Interdependent Networks ◽  
Malicious Activity ◽  
Cross System ◽  
Made In

AbstractComplex systems are challenging to control because the system responds to the controller in a nonlinear fashion, often incorporating feedback mechanisms. Interdependence of systems poses additional difficulties, as cross-system connections enable malicious activity to spread between layers, increasing systemic risk. In this paper we explore the conditions for an optimal control of cascading failures in a system of interdependent networks. Specifically, we study the Bak–Tang–Wiesenfeld sandpile model incorporating a control mechanism, which affects the frequency of cascades occurring in individual layers. This modification allows us to explore sandpile-like dynamics near the critical state, with supercritical region corresponding to infrequent large cascades and subcritical zone being characterized by frequent small avalanches. Topological coupling between networks introduces dependence of control settings adopted in respective layers, causing the control strategy of a given layer to be influenced by choices made in other connected networks. We find that the optimal control strategy for a layer operating in a supercritical regime is to be coupled to a layer operating in a subcritical zone, since such condition corresponds to reduced probability of inflicted avalanches. However this condition describes a parasitic relation, in which only one layer benefits. Second optimal configuration is a mutualistic one, where both layers adopt the same control strategy. Our results provide valuable insights into dynamics of cascading failures and and its control in interdependent complex systems.

scholarly journals Analysis on Invulnerability of Wireless Sensor Network towards Cascading Failures Based on Coupled Map Lattice

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Xiuwen Fu ◽  
Yongsheng Yang ◽  
Haiqing Yao
Keyword(s):  
Random Network ◽  
Small World ◽  
Coupled Map Lattice ◽  
Wireless Sensor ◽  
Cascading Failures ◽  
Scale Free Network ◽  
Scale Free ◽  
Network Topologies ◽  
Free Network ◽  
Entire Network

Previous research of wireless sensor networks (WSNs) invulnerability mainly focuses on the static topology, while ignoring the cascading process of the network caused by the dynamic changes of load. Therefore, given the realistic features of WSNs, in this paper we research the invulnerability of WSNs with respect to cascading failures based on the coupled map lattice (CML). The invulnerability and the cascading process of four types of network topologies (i.e., random network, small-world network, homogenous scale-free network, and heterogeneous scale-free network) under various attack schemes (i.e., random attack, max-degree attack, and max-status attack) are investigated, respectively. The simulation results demonstrate that the rise of interference R and coupling coefficient ε will increase the risks of cascading failures. Cascading threshold values Rc and εc exist, where cascading failures will spread to the entire network when R>Rc or ε>εc. When facing a random attack or max-status attack, the network with higher heterogeneity tends to have a stronger invulnerability towards cascading failures. Conversely, when facing a max-degree attack, the network with higher uniformity tends to have a better performance. Besides that, we have also proved that the spreading speed of cascading failures is inversely proportional to the average path length of the network and the increase of average degree k can improve the network invulnerability.

CAPACITY ASSIGNMENT MODEL TO DEFENSE CASCADING FAILURES

2009 ◽  
Vol 20 (07) ◽  
pp. 991-999 ◽  
Author(s):  
J. J. WU ◽  
H. J. SUN ◽  
Z. Y. GAO
Keyword(s):  
Traffic Flow ◽  
Cascading Failures ◽  
Traffic Networks ◽  
Practical Application ◽  
Assignment Rule ◽  
Scale Free ◽  
Capacity Assignment ◽  
Assignment Model ◽  
Equilibrium Assignment ◽  
Theoretical Significance

How to alleviate the damages of cascading failures triggered by the overload of edges/nodes is common in complex networks. To describe the whole cascading failures process from edges overloading to nodes malfunctioning and the dynamic spanning clustering with the evolvement of traffic flow, we propose a capacity assignment model by introducing an equilibrium assignment rule of flow in artificially created scale-free traffic networks. Additionally, the capacity update rule of node is given in this paper. We show that a single failed edge may undergo the cascading failures of nodes, and a small failure has the potential to trigger a global cascade. It is suggested that enhancing the capacity of node is particularly important for the design of any complex network to defense the cascading failures. Meanwhile, it has very important theoretical significance and practical application worthiness in the development of effective methods to alleviate the damage of one or some failed edges/nodes.

scholarly journals The robustness of interdependent networks under the interplay between cascading failures and virus propagation

2016 ◽  
Vol 115 (5) ◽  
pp. 58004 ◽  
Author(s):  
Dawei Zhao ◽  
Zhen Wang ◽  
Gaoxi Xiao ◽  
Bo Gao ◽  
Lianhai Wang
Keyword(s):  
Cascading Failures ◽  
Virus Propagation ◽  
Interdependent Networks

Impact of core-periphery structure on cascading failures in interdependent scale-free networks

2019 ◽  
Vol 383 (7) ◽  
pp. 607-616 ◽  
Author(s):  
Zhengcheng Dong ◽  
Meng Tian ◽  
Yuxin Lu ◽  
Jingang Lai ◽  
Ruoli Tang ◽  
...  
Keyword(s):  
Cascading Failures ◽  
Scale Free ◽  
Scale Free Networks
Sign in / Sign up

Export Citation Format

Share Document