Research on cascading failure in multilayer network with different coupling preference

RETRACTED: Vulnerability analysis of road network for dangerous goods transportation considering intentional attack: Based on Cellular Automata

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.

A Systematic Review on Cascading Failures Models in Renewable Power Systems with Dynamics Perspective and Protections Modeling

As industrialization accelerates, the industrial sensor network environment becomes more complex. Hierarchical multi-cluster wireless sensing network topology is generally used due to large-scale industrial environments, harsh environments, and data overload impact. In industrial wireless sensor networks, the overload of some nodes may lead to the failure of the whole network, which is called cascading failure. This phenomenon has incalculable impact on industrial production. However, cascading failure models have mainly been studied for planar structures, and there is no cascading failure model for hierarchical topologies in industrial environments. Therefore, this paper built a cascading failure model for hierarchical industrial wireless sensor networks (IWSNs) for realistic industrial network topologies. By establishing an evaluation mechanism considering the efficiency of the network and the viability of nodes, the network communication efficiency that is not considered in the traditional evaluation mechanism is solved. In addition, aiming at the problem of network topology changes caused by node failure, dynamic load distribution methods (ADD, SLD) are used to improve network invulnerability. Theoretical analysis and experimental results show that the traditional allocation method (SMLD) does not apply in hierarchical topologies; when the general cluster head node capacity is moderate, increasing the capacity of single-hop cluster head nodes can prevent cascading failures more effectively.

PurposeThe purpose of this paper is to test the invulnerability of the guarantee network at the equilibrium point.Design/methodology/approachThis paper introduces a tractable guarantee network model that captures the invulnerability of the network in terms of cascade-based attack. Furthermore, the equilibrium points are introduced for banks to determine loan origination.FindingsThe proposed approach not only develops equilibrium analysis as an extended perspective in the guarantee network, but also applies cascading failure method to construct the guarantee network. The equilibrium points are examined by simulating experiment. The invulnerability of the guarantee network is quantified by the survival of firms in the simulating progress.Research limitations/implicationsThere is less study in equilibrium analysis of the guarantee network. Additionally, cascading failure model is expressed in the presented approach. Moreover, agent-based model can be extended in generating the guarantee network in the future study.Originality/valueThe approach of this paper presents a framework to analyze the equilibrium of the guarantee network. For this, the systemic risk of the whole guarantee network and each node's contribution are measured to predict the probability of default on cascading failure. Focusing on cascade failure process based on equilibrium point, the invulnerability of the guarantee network can be quantified.

Cascading failures may lead to dramatic collapse in interdependent networks, where the breakdown takes place as a discontinuity of the order parameter. In the cascading failure (CF) model with healing there is a control parameter which at some value suppresses the discontinuity of the order parameter. However, up to this value of the healing parameter the breakdown is a hybrid transition, meaning that, besides this first order character, the transition shows scaling too. In this paper we investigate the question of universality related to the scaling behavior. Recently we showed that the hybrid phase transition in the original CF model has two sets of exponents describing respectively the order parameter and the cascade statistics, which are connected by a scaling law. In the CF model with healing we measure these exponents as a function of the healing parameter. We find two universality classes: In the wide range below the critical healing value the exponents agree with those of the original model, while above this value the model displays trivial scaling meaning that fluctuations follow the central limit theorem.

This paper investigates the possibility of saving a network that is predicted to have a cascading failure that will eventually lead to a total collapse. We model cascading failures using the recently proposed KQ model. Then predict an impending total collapse by monitoring critical slowing down indicators and subsequently attempt to prevent the total collapse of the network by adding new nodes. To this end, we systematically evaluate five node addition rules, the effect of intervention delay and network degree heterogeneity. Surprisingly, unlike for random homogeneous networks, we find that a delayed intervention is preferred for saving scale free networks. We also find that for homogeneous networks, the best strategy is to wire newly added nodes to existing nodes in a uniformly random manner. For heterogeneous networks, however, a random selection of nodes based on their degree mostly outperforms a uniform random selection. These results provide new insights into restoring networks by adding nodes after observing early warnings of an impending complete breakdown.

An efficient local cascade defense method in complex networks

There have been many researches on border gateway protocol (BGP) security, most of which mainly focused on how to enhance the security of the BGP protocol or the interdomain routing system. However, few works studied the vulnerabilities especially the production mechanism of security events in the interdomain routing system. It takes many obstacles to understand and improve the security of the interdomain routing system. This paper explores the cascading failure phenomenon of the interdomain routing system. First, we devise a state machine to describe the state transition of BGP nodes and then give a detailed analysis of the BGP failure. Second, on the basis of the preferential attachment characteristic, we propose a cascading failure model for the interdomain routing system, which depicts the production mechanism of cascading failure, and introduce two evaluating indicators, the proportion of failed nodes and the proportion of failed links, to assess the scale of cascading failure. Furthermore, we apply the cascading failure model to display two different cascading failure scenes. The experimental results show that random failure has less influence on the interdomain routing system, while its robustness against hostile attack is weak. Copyright ©2011 John Wiley & Sons, Ltd.

Taking into account the fact that overload failures in real-world functional networks are usually caused by extreme values of temporally fluctuating loads that exceed the allowable range, we study the robustness of scale-free networks against cascading overload failures induced by fluctuating loads. In our model, loads are described by random walkers moving on a network and a node fails when the number of walkers on the node is beyond the node capacity. Our results obtained by using the generating function method show that scale-free networks are more robust against cascading overload failures than Erdős-Rényi random graphs with homogeneous degree distributions. This conclusion is contrary to that predicted by previous works, which neglect the effect of fluctuations of loads.

The massive power flow transferring triggers the node overload cascade, which further activates the protection system hidden failures. In this study, we propose a cascading failure model based on complex network theory by combining the node overload failures and hidden failures of transmission lines in blackouts together. The model concerns the electrical characteristics, which has not been involved in the existed cascading failure model when modelling node loads. The cascading failure simulations on the 500 kV Center China power grid and the IEEE‐300‐bus test system demonstrate that the proposed cascading failure model with node load built on electrical characteristics can bring better network invulnerability than the model with that constructed on pure structure topology. Meanwhile, the proposed model can better exhibit the negative aspects of hidden failures in the blackouts. The deliberate attacks based on high‐risk nodes can decrease the invulnerability of power grids more seriously compared with those based on high‐degree and high‐load nodes. The results provide a new way to analyse the power grid cascading failure mechanism based on the complex network theory.

The robustness of complex networks against cascading failures has been of great interest, while most of the researchers have considered undirected networks. However, to be more realistic, a part of links of many real systems should be described as unidirectional. In this paper, by applying three link direction-determining (DD) strategies, the tolerance of cascading failures is investigated in various networks with both unidirectional and bidirectional links. By extending the utilization of a classical global betweenness method, we propose a new cascading model, taking into account the weights of nodes and the directions of links. Then, the effects of unidirectional links on the network robustness against cascaded attacks are examined under the global load-based distribution mechanism. The simulation results show that the link-directed methods could not always lead to the decrease of the network robustness as indicated in the previous studies. For small-world networks, these methods certainly make the network weaker. However, for scale-free networks, the network robustness can be significantly improved by the link-directed method, especially for the method with non-random DD strategies. These results are independent of the weight parameter of the nodes. Due to the strongly improved robustness and easy realization with low cost on networks, the method for enforcing proper links to the unidirectional ones may be useful for leading to insights into the control of cascading failures in real-world networks, like communication and transportation networks.

The robustness of infrastructure networks has attracted great attention in recent years. Scholars have studied the robustness of complex networks against cascading failures from different aspects. In this paper, a new capacity allocation strategy is proposed to reduce cascading failures and improve network robustness without changing the network structure. Compared with the typical strategy proposed in Motter–Lai (ML) model, the new strategy can reduce the scale of cascading failure. The new strategy applied in scale-free network is more efficient. In addition, to reasonably evaluate the two strategies, we introduce contribution rate of unit capacity to network robustness as evaluation index. Results show that our new strategy works well, and it is more advantageous in the rational utilization of capacity in scale-free networks. Furthermore, we were surprised to find that the efficient utilization of capacity costs declined as costs rose above a certain threshold, which indicates that it is not wise to restrain cascading failures by increasing capacity costs indefinitely.

Robustness of networks with dependency groups considering fluctuating loads and recovery behaviors

In preventing large-scale congestion caused by urban road traffic attacks, both random and deliberate attack methods were employed, with the robustness of the traffic system analyzed using a cascading failure model. The details of the proposed methods are, firstly, a road network model is constructed based on a Geographic Information System (GIS), and the traffic flow data of a provincial city during peak traffic hours is obtained by Python. Then, the flow data of Origin-Destination (OD) pairs for the road network under normal operation is obtained using the OD estimation module in TransCAD, the urban transportation network is modeled based on the actual traffic flow distribution. Subsequently, random attacks and deliberate attacks based on traffic volume were conducted on the road network. The traffic flow of the attacked segments was reallocated according to a cascading failure model, with the robustness of the urban road network assessed using topological and traffic flow indicators. The results indicate that, in the robustness analysis considering cascading failures, deliberate attacks have a more significant impact on high-traffic segments compared to random attacks with the same number of attack steps. Therefore, future urban traffic management should focus on ensuring the efficiency of high-traffic road segments, and prevent it from becoming ineffective due to excessive traffic flow.