In this article, we investigate cascading failures in complex networks by introducing a feedback. To characterize the effect of the feedback, we define a procedure that involves a self-organization of trip distributio...In this article, we investigate cascading failures in complex networks by introducing a feedback. To characterize the effect of the feedback, we define a procedure that involves a self-organization of trip distribution during the process of cascading failures. For this purpose, user equilibrium with variable demand is used as an alternative way to determine the traffic flow pattern throughout the network. Under the attack, cost function dynamics are introduced to discuss edge overload in complex networks, where each edge is assigned a finite capacity （controlled by parameter α）. We find that scale-free networks without considering the effect of the feedback are expected to be very sensitive to α as compared with random networks, while this situation is largely improved after introducing the feedback.展开更多
This paper investigates cascading failures in networks by considering interplay between the flow dynamic and the network topology, where the fluxes exchanged between a pair of nodes can be adaptively adjusted dependin...This paper investigates cascading failures in networks by considering interplay between the flow dynamic and the network topology, where the fluxes exchanged between a pair of nodes can be adaptively adjusted depending on the changes of the shortest path lengths between them. The simulations on both an artificially created scale-free network and the real network structure of the power grid reveal that the adaptive adjustment of the fluxes can drastically enhance the robustness of complex networks against cascading failures. Particularly, there exists an optimal region where the propagation of the cascade is significantly suppressed and the fluxes supported by the network are maximal. With this understanding, a costless strategy of defense for preventing cascade breakdown is proposed. It is shown to be more effective for suppressing the propagation of the cascade than the recent proposed strategy of defense based on the intentional removal of nodes.展开更多
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...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.展开更多
Cascading failures often occur in congested networks such as the Internet. A cascading failure can be described as a three-phase process： generation, diffusion, and dissipation of the congestion. In this account, we ...Cascading failures often occur in congested networks such as the Internet. A cascading failure can be described as a three-phase process： generation, diffusion, and dissipation of the congestion. In this account, we present a function that represents the extent of congestion on a given node. This approach is different from existing fimctions based on betweenness centrality. By introducing the concept of ＇delay time＇, we designate an intergradation between permanent removal and nonremoval. We also construct an evaluation fimction of network efficiency, based on congestion, which measures the damage caused by cascading failures. Finally, we investigate the effects of network structure and size, delay time, processing ability and packet generation speed on congestion propagation. Also, we uncover the relationship between the cascade dynamics and some properties of the network such as structure and size.展开更多
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 the betweenness central...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 the betweenness centrality, a congestion function is proposed to represent the extent of congestion on a given node. Inspired by the restart process of a node, we introduce the concept of ＂delay time,＂ during which the overloaded node Cannot receive or forward any traffic, so an intergradation between permanent removal and nonremoval is built and the flexibility of the presented model is demonstrated. Considering the connectivity of a network before and after cascading failures is not cracked because the overloaded node are not removed from network permanently in our model, a new evaluation function of network efficiency is also proposed to measure the damage caused by cascading failures. Finally, we investigate the effects of network structure and size, delay time, processing ability, and traffic generation speed on congestion propagation. Cascading processes composed of three phases and some factors affecting cascade propagation are uncovered as well.展开更多
Critical infrastructures are becoming increasingly interdependent and vulnerable to cascading failures. Existing studies have analyzed the vulnerability of interdependent networks to cascading failures from the static...Critical infrastructures are becoming increasingly interdependent and vulnerable to cascading failures. Existing studies have analyzed the vulnerability of interdependent networks to cascading failures from the static perspective of network topology structure. This paper develops a more realistic cascading failures model that considers the dynamic redistribution of load in power network to explore the vulnerability of interdependent power-water networks. In this model, the critical tolerance threshold is originally proposed to indicate the vulnerability of network to cascading failures. In addition, some key parameters that are important to network vulnerability are identified and quantified through numerical simulation. Results show that cascading failures can be prevented when the values of tolerance parameter are above a critical tolerance threshold. Otherwise interdependent networks collapse after attacking a critical fraction of power nodes. Interdependent networks become more vulnerable with the increase in interdependence strength, which implies the importance of protecting those interconnected nodes to reduce the consequences of cascading failures. Interdependent networks are most vulnerable under high-load attack, which shows the significance of protecting high-load nodes.展开更多
The local-world (LW) evolving network model shows a transition for the degree distribution between the exponential and power-law distributions, depending on the LW size. Cascading failures under intentional attacks in...The local-world (LW) evolving network model shows a transition for the degree distribution between the exponential and power-law distributions, depending on the LW size. Cascading failures under intentional attacks in LW network models with different LW sizes were investigated using the cascading failures load model. We found that the LW size has a significant impact on the network's robustness against deliberate attacks. It is much easier to trigger cascading failures in LW evolving networks with a larger LW size. Therefore, to avoid cascading failures in real networks with local preferential attachment such as the Internet, the World Trade Web and the multi-agent system, the LW size should be as small as possible.展开更多
Cascading failures in infrastructure networks have serious impacts on network function.The limited capacity of net-work nodes provides a necessary condition for cascade failure.However,the network capacity cannot be i...Cascading failures in infrastructure networks have serious impacts on network function.The limited capacity of net-work nodes provides a necessary condition for cascade failure.However,the network capacity cannot be infinite in the real net-work system.Therefore,how to reasonably allocate the limited capacity resources is of great significance.In this article,we put forward a capacity allocation strategy based on community structure against cascading failure.Experimental results indi-cate that the proposed method can reduce the scale of cascade failures with higher capacity utilization compared with Motter-Lai(ML)model.The advantage of our method is more obvious in scale-free network.Furthermore,the experiment shows that the cascade effect is more obvious when the vertex load is ran-domly varying.It is known to all that the growth of network capacity can make the network more resistant to destruction,but in this paper it is found that the contribution rate of unit capacity rises first and then decreases with the growth of net-work capacity cost.展开更多
Cascading failure can cause great damage to complex networks, so it is of great significance to improve the network robustness against cascading failure. Many previous existing works on load-redistribution strategies ...Cascading failure can cause great damage to complex networks, so it is of great significance to improve the network robustness against cascading failure. Many previous existing works on load-redistribution strategies require global information, which is not suitable for large scale networks, and some strategies based on local information assume that the load of a node is always its initial load before the network is attacked, and the load of the failure node is redistributed to its neighbors according to their initial load or initial residual capacity. This paper proposes a new load-redistribution strategy based on local information considering an ever-changing load. It redistributes the loads of the failure node to its nearest neighbors according to their current residual capacity, which makes full use of the residual capacity of the network. Experiments are conducted on two typical networks and two real networks, and the experimental results show that the new load-redistribution strategy can reduce the size of cascading failure efficiently.展开更多
基金Project partly supported by National Basic Research Program of China (Grant No 2006CB705500)National Natural Science Foundation of China (Grant Nos 70631001, 70671008 and 70801005)the Innovation Foundation of Science and Technology for Excellent Doctorial Candidate of Beijing Jiaotong University (Grant No 48033)
文摘In this article, we investigate cascading failures in complex networks by introducing a feedback. To characterize the effect of the feedback, we define a procedure that involves a self-organization of trip distribution during the process of cascading failures. For this purpose, user equilibrium with variable demand is used as an alternative way to determine the traffic flow pattern throughout the network. Under the attack, cost function dynamics are introduced to discuss edge overload in complex networks, where each edge is assigned a finite capacity （controlled by parameter α）. We find that scale-free networks without considering the effect of the feedback are expected to be very sensitive to α as compared with random networks, while this situation is largely improved after introducing the feedback.
基金Project supported by the National Natural Science Foundation of China(Grant No.30570432)the General Project of Hunan Provincial Educational Department of China(Grant No.07C754)
文摘This paper investigates cascading failures in networks by considering interplay between the flow dynamic and the network topology, where the fluxes exchanged between a pair of nodes can be adaptively adjusted depending on the changes of the shortest path lengths between them. The simulations on both an artificially created scale-free network and the real network structure of the power grid reveal that the adaptive adjustment of the fluxes can drastically enhance the robustness of complex networks against cascading failures. Particularly, there exists an optimal region where the propagation of the cascade is significantly suppressed and the fluxes supported by the network are maximal. With this understanding, a costless strategy of defense for preventing cascade breakdown is proposed. It is shown to be more effective for suppressing the propagation of the cascade than the recent proposed strategy of defense based on the intentional removal of nodes.
文摘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.
基金the National Natural Science Foundation of China (No. 60573128)the Ph.D. Programs Foundation of Ministry of Education of China (No. 20060183043)+1 种基金the China–British Columbia Innovation and Commercialization Strategic Develop-ment Grant (No. 2008DFA12140)the Jilin University 985 Graduate Student Innovation Foundation (No. 20080235)
文摘Cascading failures often occur in congested networks such as the Internet. A cascading failure can be described as a three-phase process： generation, diffusion, and dissipation of the congestion. In this account, we present a function that represents the extent of congestion on a given node. This approach is different from existing fimctions based on betweenness centrality. By introducing the concept of ＇delay time＇, we designate an intergradation between permanent removal and nonremoval. We also construct an evaluation fimction of network efficiency, based on congestion, which measures the damage caused by cascading failures. Finally, we investigate the effects of network structure and size, delay time, processing ability and packet generation speed on congestion propagation. Also, we uncover the relationship between the cascade dynamics and some properties of the network such as structure and size.
基金supported by the China –BC ICSD Grant(No. 2008DFA12140)the Ph.D. Programs Foundation of Ministry of Education of China(No. 20060183043)Jilin University 985 Program Graduate Student Innovation Foundation(No. 20080235)
文摘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 the betweenness centrality, a congestion function is proposed to represent the extent of congestion on a given node. Inspired by the restart process of a node, we introduce the concept of ＂delay time,＂ during which the overloaded node Cannot receive or forward any traffic, so an intergradation between permanent removal and nonremoval is built and the flexibility of the presented model is demonstrated. Considering the connectivity of a network before and after cascading failures is not cracked because the overloaded node are not removed from network permanently in our model, a new evaluation function of network efficiency is also proposed to measure the damage caused by cascading failures. Finally, we investigate the effects of network structure and size, delay time, processing ability, and traffic generation speed on congestion propagation. Cascading processes composed of three phases and some factors affecting cascade propagation are uncovered as well.
基金Acknowledgments This work is supported by National Natural Science Foundation of China （No. 71501158 71471146） and ＂the Fundamental Research Funds for the Central Universities＂. The authors would like to thank the referees for their efforts to improve the quality of this paper.
文摘Critical infrastructures are becoming increasingly interdependent and vulnerable to cascading failures. Existing studies have analyzed the vulnerability of interdependent networks to cascading failures from the static perspective of network topology structure. This paper develops a more realistic cascading failures model that considers the dynamic redistribution of load in power network to explore the vulnerability of interdependent power-water networks. In this model, the critical tolerance threshold is originally proposed to indicate the vulnerability of network to cascading failures. In addition, some key parameters that are important to network vulnerability are identified and quantified through numerical simulation. Results show that cascading failures can be prevented when the values of tolerance parameter are above a critical tolerance threshold. Otherwise interdependent networks collapse after attacking a critical fraction of power nodes. Interdependent networks become more vulnerable with the increase in interdependence strength, which implies the importance of protecting those interconnected nodes to reduce the consequences of cascading failures. Interdependent networks are most vulnerable under high-load attack, which shows the significance of protecting high-load nodes.
基金the National Basic Research Program (973) of China (No. 2004CB217902)the National Natural Science Foundation of China (Nos. 60421002 and 60804045)the Postdoctoral Science Foundation of China (No. 20070421163)
文摘The local-world (LW) evolving network model shows a transition for the degree distribution between the exponential and power-law distributions, depending on the LW size. Cascading failures under intentional attacks in LW network models with different LW sizes were investigated using the cascading failures load model. We found that the LW size has a significant impact on the network's robustness against deliberate attacks. It is much easier to trigger cascading failures in LW evolving networks with a larger LW size. Therefore, to avoid cascading failures in real networks with local preferential attachment such as the Internet, the World Trade Web and the multi-agent system, the LW size should be as small as possible.
文摘Cascading failures in infrastructure networks have serious impacts on network function.The limited capacity of net-work nodes provides a necessary condition for cascade failure.However,the network capacity cannot be infinite in the real net-work system.Therefore,how to reasonably allocate the limited capacity resources is of great significance.In this article,we put forward a capacity allocation strategy based on community structure against cascading failure.Experimental results indi-cate that the proposed method can reduce the scale of cascade failures with higher capacity utilization compared with Motter-Lai(ML)model.The advantage of our method is more obvious in scale-free network.Furthermore,the experiment shows that the cascade effect is more obvious when the vertex load is ran-domly varying.It is known to all that the growth of network capacity can make the network more resistant to destruction,but in this paper it is found that the contribution rate of unit capacity rises first and then decreases with the growth of net-work capacity cost.
基金Project supported by the National Basic Research Program of China(Grant No.2013CB328903)the Special Fund of 2011 Internet of Things Development of Ministry of Industry and Information Technology,China(Grant No.2011BAJ03B13-2)+1 种基金the National Natural Science Foundation of China(Grant No.61473050)the Key Science and Technology Program of Chongqing,China(Grant No.cstc2012gg-yyjs40008)
文摘Cascading failure can cause great damage to complex networks, so it is of great significance to improve the network robustness against cascading failure. Many previous existing works on load-redistribution strategies require global information, which is not suitable for large scale networks, and some strategies based on local information assume that the load of a node is always its initial load before the network is attacked, and the load of the failure node is redistributed to its neighbors according to their initial load or initial residual capacity. This paper proposes a new load-redistribution strategy based on local information considering an ever-changing load. It redistributes the loads of the failure node to its nearest neighbors according to their current residual capacity, which makes full use of the residual capacity of the network. Experiments are conducted on two typical networks and two real networks, and the experimental results show that the new load-redistribution strategy can reduce the size of cascading failure efficiently.
