ترغب بنشر مسار تعليمي؟ اضغط هنا

Dynamic Effects Increasing Network Vulnerability to Cascading Failures

116   0   0.0 ( 0 )
 نشر من قبل Ingve Simonsen
 تاريخ النشر 2008
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

We study cascading failures in networks using a dynamical flow model based on simple conservation and distribution laws to investigate the impact of transient dynamics caused by the rebalancing of loads after an initial network failure (triggering event). It is found that considering the flow dynamics may imply reduced network robustness compared to previous static overload failure models. This is due to the transient oscillations or overshooting in the loads, when the flow dynamics adjusts to the new (remaining) network structure. We obtain {em upper} and {em lower} limits to network robustness, and it is shown that {it two} time scales $tau$ and $tau_0$, defined by the network dynamics, are important to consider prior to accurately addressing network robustness or vulnerability. The robustness of networks showing cascading failures is generally determined by a complex interplay between the network topology and flow dynamics, where the ratio $chi=tau/tau_0$ determines the relative role of the two of them.



قيم البحث

اقرأ أيضاً

Cascading failure is a potentially devastating process that spreads on real-world complex networks and can impact the integrity of wide-ranging infrastructures, natural systems, and societal cohesiveness. One of the essential features that create com plex network vulnerability to failure propagation is the dependency among their components, exposing entire systems to significant risks from destabilizing hazards such as human attacks, natural disasters or internal breakdowns. Developing realistic models for cascading failures as well as strategies to halt and mitigate the failure propagation can point to new approaches to restoring and strengthening real-world networks. In this review, we summarize recent progress on models developed based on physics and complex network science to understand the mechanisms, dynamics and overall impact of cascading failures. We present models for cascading failures in single networks and interdependent networks and explain how different dynamic propagation mechanisms can lead to an abrupt collapse and a rich dynamic behavior. Finally, we close the review with novel emerging strategies for containing cascades of failures and discuss open questions that remain to be addressed.
In todays global economy, supply chain (SC) entities have become increasingly interconnected with demand and supply relationships due to the need for strategic outsourcing. Such interdependence among firms not only increases efficiency but also creat es more vulnerabilities in the system. Natural and human-made disasters such as floods and transport accidents may halt operations and lead to economic losses. Due to the interdependence among firms, the adverse effects of any disruption can be amplified and spread throughout the systems. This paper aims at studying the robustness of SC networks against cascading failures. Considering the upper and lower bound load constraints, i.e., inventory and cost, we examine the fraction of failed entities under load decrease and load fluctuation scenarios. The simulation results obtained from synthetic networks and a European supply chain network [1] both confirm that the recovery strategies of surplus inventory and backup suppliers often adopted in actual SCs can enhance the system robustness, compared with the system without the recovery process. In addition, the system is relatively robust against load fluctuations but is more fragile to demand shocks. For the underload-driven model without the recovery process, we found an occurrence of a discontinuous phase transition. Differently from other systems studied under overload cascading failures, this system is more robust for power-law distributions than uniform distributions of the lower bound parameter for the studied scenarios.
Cascading failures constitute an important vulnerability of interconnected systems. Here we focus on the study of such failures on networks in which the connectivity of nodes is constrained by geographical distance. Specifically, we use random geomet ric graphs as representative examples of such spatial networks, and study the properties of cascading failures on them in the presence of distributed flow. The key finding of this study is that the process of cascading failures is non-self-averaging on spatial networks, and thus, aggregate inferences made from analyzing an ensemble of such networks lead to incorrect conclusions when applied to a single network, no matter how large the network is. We demonstrate that this lack of self-averaging disappears with the introduction of a small fraction of long-range links into the network. We simulate the well studied preemptive node removal strategy for cascade mitigation and show that it is largely ineffective in the case of spatial networks. We introduce an altruistic strategy designed to limit the loss of network nodes in the event of a cascade triggering failure and show that it performs better than the preemptive strategy. Finally, we consider a real-world spatial network viz. a European power transmission network and validate that our findings from the study of random geometric graphs are also borne out by simulations of cascading failures on the empirical network.
The structure of real-world multilayer infrastructure systems usually exhibits anisotropy due to constraints of the embedding space. For example, geographical features like mountains, rivers and shores influence the architecture of critical infrastru cture networks. Moreover, such spatial networks are often non-homogeneous but rather have a modular structure with dense connections within communities and sparse connections between neighboring communities. When the networks of the different layers are interdependent, local failures and attacks may propagate throughout the system. Here we study the robustness of spatial interdependent networks which are both anisotropic and heterogeneous. We also evaluate the effect of localized attacks having different geometrical shapes. We find that anisotropic networks are more robust against localized attacks and that anisotropic attacks, surprisingly, even on isotropic structures, are more effective than isotropic attacks.
We propose a dynamical model for cascading failures in single-commodity network flows. In the proposed model, the network state consists of flows and activation status of the links. Network dynamics is determined by a, possibly state-dependent and ad versarial, disturbance process that reduces flow capacity on the links, and routing policies at the nodes that have access to the network state, but are oblivious to the presence of disturbance. Under the proposed dynamics, a link becomes irreversibly inactive either due to overload condition on itself or on all of its immediate downstream links. The coupling between link activation and flow dynamics implies that links to become inactive successively are not necessarily adjacent to each other, and hence the pattern of cascading failure under our model is qualitatively different than standard cascade models. The magnitude of a disturbance process is defined as the sum of cumulative capacity reductions across time and links of the network, and the margin of resilience of the network is defined as the infimum over the magnitude of all disturbance processes under which the links at the origin node become inactive. We propose an algorithm to compute an upper bound on the margin of resilience for the setting where the routing policy only has access to information about the local state of the network. For the limiting case when the routing policies update their action as fast as network dynamics, we identify sufficient conditions on network parameters under which the upper bound is tight under an appropriate routing policy. Our analysis relies on making connections between network parameters and monotonicity in network state evolution under proposed dynamics.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا