共查询到20条相似文献,搜索用时 46 毫秒
1.
A limited resource model of fault-tolerant capability
against cascading failure of complex network 总被引:1,自引:0,他引:1
P. Li B.-H. Wang H. Sun P. Gao T. Zhou 《The European Physical Journal B - Condensed Matter and Complex Systems》2008,62(1):101-104
We propose a novel capacity model for complex networks
against cascading failure. In this model, vertices with both higher
loads and larger degrees should be paid more extra capacities, i.e.
the allocation of extra capacity on vertex i will be proportional
to ki
γ , where ki is the degree of vertex i
and γ > 0 is a free parameter. We have applied this model on
Barabási-Albert network as well as two real transportation
networks, and found that under the same amount of available
resource, this model can achieve better network robustness than
previous models. 相似文献
2.
Complex networks may undergo a global cascade of overload failures when a single highly loaded vertex or edge is intentionally attacked. Here we use the recent load model of cascading failures to investigate the performance of the small-world (SW) and scale-free (SF) networks subject to deliberate attacks on vertex and edge. Simulation results suggest that compared with the SW network, the SF network is more vulnerable to deliberate vertex attacks and more robust to deliberate edge attacks. In the SF network, deliberate vertex attacks can result in larger cascading failures than deliberate edge attacks; however, in the SW network the situation is opposite. Furthermore, with the increase of the rewiring probability the SW network becomes more and more robust to deliberate vertex and edge attacks. 相似文献
3.
《中国物理 B》2021,30(5):50501-050501
We explore the robustness of a network against failures of vertices or edges where a fraction f of vertices is removed and an overload model based on betweenness is constructed. It is assumed that the load and capacity of vertex i are correlated with its betweenness centrality B_i as B_i~θ and(1 + α)Bθi(θ is the strength parameter, α is the tolerance parameter).We model the cascading failures following a local load preferential sharing rule. It is found that there exists a minimal αc when θ is between 0 and 1, and its theoretical analysis is given. The minimal αc characterizes the strongest robustness of a network against cascading failures triggered by removing a random fraction f of vertices. It is realized that the minimalαc increases with the increase of the removal fraction f or the decrease of average degree. In addition, we compare the robustness of networks whose overload models are characterized by degree and betweenness, and find that the networks based on betweenness have stronger robustness against the random removal of a fraction f of vertices. 相似文献
4.
We propose a new concept, two-step degree. Defining it as the capacity of a node of complex networks, we establish a novel capacity-load model of cascading failures of complex networks where the capacity of nodes decreases during the process of cascading failures. For scale-free networks, we find that the average two-step degree increases with the increase of the heterogeneity of the degree distribution, showing that the average two- step degree can be used for measuring the heterogeneity of the degree distribution of complex networks. In addition, under the condition that the average degree of a node is given, we can design a scale-free network with the optimal robustness to random failures by maximizing the average two-step degree. 相似文献
5.
A robust matching model of capacity to defense cascading failure on complex networks 总被引:2,自引:0,他引:2
H.J. Sun 《Physica A》2008,387(25):6431-6435
How to control the cascading failure has become a hot topic in recent years. In this paper, we propose a new matching model of capacity by developing a profit function to defense cascading failures on artificially created scale-free networks and the real network structure of the North American power grid. Results show that our matching model can enhance the network robustness efficiently, which is particularly important for the design of networks to deduce the damage triggered by the cascading failures. 相似文献
6.
In this paper, adopting the initial load of a node i to be with ki being the degree of the node i, we propose a cascading model based on a load local redistribution rule and examine cascading failures on the typical network, i.e., the BA network with the scale-free property. We find that the BA scale-free network reaches the strongest robustness level in the case of α=1 and the robustness of the network has a positive correlation with the average degree 〈k〉, where the robustness is quantified by a transition from normal state to collapse. In addition, we further discuss the effects of two different attacks for the robustness against cascading failures on our cascading model and find an interesting result, i.e., the effects of two different attacks, strongly depending to the value α. These results may be very helpful for real-life networks to avoid cascading-failure-induced disasters. 相似文献
7.
The epidemic spread and immunizations in geographically embedded scale-free (SF) and Watts-Strogatz (WS) networks are numerically investigated. We make a realistic assumption that it takes time which we call the detection time, for a vertex to be identified as infected, and implement two different immunization strategies: one is based on connection neighbors (CN) of the infected vertex with the exact information of the network structure utilized and the other is based on spatial neighbors (SN) with only geographical distances taken into account. We find that the decrease of the detection time is crucial for a successful immunization in general. Simulation results show that for both SF networks and WS networks, the SN strategy always performs better than the CN strategy, especially for more heterogeneous SF networks at long detection time. The observation is verified by checking the number of the infected nodes being immunized. We found that in geographical space, the distance preferences in the network construction process and the geographically decaying infection rate are key factors that make the SN immunization strategy outperforms the CN strategy. It indicates that even in the absence of the full knowledge of network connectivity we can still stop the epidemic spread efficiently only by using geographical information as in the SN strategy, which may have potential applications for preventing the real epidemic spread. 相似文献
8.
Considering that not all overload nodes will be removed from networks due to some effective measures to protect them, we propose a new cascading model with a breakdown probability. Adopting the initial load of a node j to be Lj=[kj(∑m∈Γjkm)]α with kj and Γj being the degree of the node j and the set of its neighboring nodes, respectively, where α is a tunable parameter, we investigate the relationship between some parameters and universal robustness characteristics against cascading failures on scale-free networks. According to a new measure originated from a phase transition from the normal state to collapse, the numerical simulations show that Barabási-Albert (BA) networks reach the strongest robustness level against cascading failures when the tunable parameter α=0.5, while not relating to the breakdown probability. We furthermore explore the effect of the average degree 〈k〉 for network robustness, thus obtaining a positive correlation between 〈k〉 and network robustness. We then analyze the effect of the breakdown probability on the network robustness and confirm by theoretical predictions this universal robustness characteristic observed in simulations. Our work may have practical implications for controlling various cascading-failure-induced disasters in the real world. 相似文献
9.
Most previous existing works on cascading failures only focused on attacks on nodes rather than on edges. In this paper, we discuss the response of scale-free networks subject to two different attacks on edges during cascading propagation, i.e., edge removal by either the descending or ascending order of the loads. Adopting a cascading model with a breakdown probability p of an overload edge and the initial load (kikj)α of an edge ij, where ki and kj are the degrees of the nodes connected by the edge ij and α is a tunable parameter, we investigate the effects of two attacks for the robustness of Barabási-Albert (BA) scale-free networks against cascading failures. In the case of α<1, our investigation by the numerical simulations leads to a counterintuitive finding that BA scale-free networks are more sensitive to attacks on the edges with the lowest loads than the ones with the highest loads, not relating to the breakdown probability. In addition, the same effect of two attacks in the case of α=1 may be useful in furthering studies on the control and defense of cascading failures in many real-life networks. We then confirm by the theoretical analysis these results observed in simulations. 相似文献
10.
H. Zhao Z.-Y. Gao 《The European Physical Journal B - Condensed Matter and Complex Systems》2007,57(1):95-101
In this paper, we investigate cascade defense and control
in scale free networks via navigation strategy. It is found
that with an appropriate parameter a, which is tunable in
controlling the effect of degree in the navigation strategy, one can
reduce the risk of cascade break down. By checking the distribution
of efficient betweenness centrality (EBC) and the average EBC
of vertices with degree k, the validity can be guaranteed. Despite
the advantage of cascade defense, the degree based navigation
strategy may also lead to lower network efficiency. To avoid this
disadvantage, we propose a new navigation strategy. Importantly and
interestingly, the new strategy can defend cascade break down
effectively even without reducing the network efficiency.
Distribution of the EBC and EBC-degree correlation of the new
strategy are also investigated to explain the effectiveness in
cascade defense. 相似文献
11.
A. P. Quayle A. S. Siddiqui S. J.M. Jones 《The European Physical Journal B - Condensed Matter and Complex Systems》2006,50(4):617-630
We propose a model of an underlying mechanism responsible for the formation of assortative mixing in networks between “similar”
nodes or vertices based on generic vertex properties. Existing models focus on a particular type of assortative mixing, such
as mixing by vertex degree, or present methods of generating a network with certain properties, rather than modeling a mechanism
driving assortative mixing during network growth. The motivation is to model assortative mixing by non-topological vertex
properties, and the influence of these non-topological properties on network topology. The model is studied in detail for
discrete and hierarchical vertex properties, and we use simulations to study the topology of resulting networks. We show that
assortative mixing by generic properties directly drives the formation of community structure beyond a threshold assortativity
of r ∼0.5, which in turn influences other topological properties. This direct relationship is demonstrated by introducing
a new measure to characterise the correlation between assortative mixing and community structure in a network. Additionally,
we introduce a novel type of assortative mixing in systems with hierarchical vertex properties, from which a hierarchical
community structure is found to result.
Electronic supplementary material Supplementary Online Material 相似文献
12.
Cascading dynamics in congested complex networks 总被引:1,自引:0,他引:1
J. Wang Y.-H. Liu Y. Jiao H.-Y. Hu 《The European Physical Journal B - Condensed Matter and Complex Systems》2009,67(1):95-100
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 betweenness centrality, we propose a congestion function
to represent the extent of congestion on a given node. By introducing the concept of “delay time”, we construct an intergradation
between permanent removal and nonremoval. We also build a new evaluation function of network efficiency, based on congestion,
which measures the damage caused by cascading failures. Finally, based on Statnet and Webgraph topologies we investigate the
effects of network structure and size, delay time, processing ability and traffic generation speed on congestion propagation.
Also we uncover cascading process composed of three phases and some factors affecting cascade propagation. 相似文献
13.
A preferential attachment model for a growing network incorporating the deletion of edges is studied and the expected asymptotic degree distribution is analyzed. At each time step t=1,2,…, with probability π1>0 a new vertex with one edge attached to it is added to the network and the edge is connected to an existing vertex chosen proportionally to its degree, with probability π2 a vertex is chosen proportionally to its degree and an edge is added between this vertex and a randomly chosen other vertex, and with probability π3=1−π1−π2<1/2 a vertex is chosen proportionally to its degree and a random edge of this vertex is deleted. The model is intended to capture a situation where high-degree vertices are more dynamic than low-degree vertices in the sense that their connections tend to be changing. A recursion formula is derived for the expected asymptotic fraction pk of vertices with degree k, and solving this recursion reveals that, for π3<1/3, we have pk∼k−(3−7π3)/(1−3π3), while, for π3>1/3, the fraction pk decays exponentially at rate (π1+π2)/2π3. There is hence a non-trivial upper bound for how much deletion the network can incorporate without losing the power-law behavior of the degree distribution. The analytical results are supported by simulations. 相似文献
14.
B. Karrer G. Ghoshal 《The European Physical Journal B - Condensed Matter and Complex Systems》2008,62(2):239-245
There has been a considerable amount of interest in recent years on the robustness of networks to failures. Many previous
studies have concentrated on the effects of node and edge removals on the connectivity structure of a static network; the networks are considered to be static in the sense that no compensatory measures are allowed for recovery of
the original structure. Real world networks such as the world wide web, however, are not static and experience a considerable
amount of turnover, where nodes and edges are both added and deleted. Considering degree-based node removals, we examine the
possibility of preserving networks from these types of disruptions. We recover the original degree distribution by allowing
the network to react to the attack by introducing new nodes and attaching their edges via specially tailored schemes. We focus
particularly on the case of non-uniform failures, a subject that has received little attention in the context of evolving
networks. Using a combination of analytical techniques and numerical simulations, we demonstrate how to preserve the exact degree distribution of the studied networks from various forms of attack. 相似文献
15.
A cyber-physical supply network is composed of an undirected cyber supply network and a directed physical supply network. Such interdependence among firms increases efficiency but creates more vulnerabilities. The adverse effects of any failure can be amplified and propagated throughout the network. This paper aimed at investigating the robustness of the cyber-physical supply network against cascading failures. Considering that the cascading failure is triggered by overloading in the cyber supply network and is provoked by underload in the physical supply network, a realistic cascading model for cyber-physical supply networks is proposed. We conducted a numerical simulation under cyber node and physical node failure with varying parameters. The simulation results demonstrated that there are critical thresholds for both firm’s capacities, which can determine whether capacity expansion is helpful; there is also a cascade window for network load distribution, which can determine the cascading failures occurrence and scale. Our work may be beneficial for developing cascade control and defense strategies in cyber-physical supply networks. 相似文献
16.
This paper studies the cascading failure on random networks and
scale-free networks by introducing the tolerance parameter of edge
based on the coupled map lattices methods. The whole work focuses on
investigating some indices including the number of failed edges,
dynamic edge tolerance capacity and the perturbation of edge. In
general, it assumes that the perturbation is attributed to the
normal distribution in adopted simulations. By investigating the
effectiveness of edge tolerance in scale-free and random networks,
it finds that the larger tolerance parameter λ can more
efficiently delay the cascading failure process for scale-free
networks than random networks. These results indicate that the
cascading failure process can be effectively controlled by
increasing the tolerance parameter λ. Moreover, the
simulations also show that, larger variance of perturbation can
easily trigger the cascading failures than the smaller one. This
study may be useful for evaluating efficiency of whole traffic
systems, and for alleviating cascading failure in such systems. 相似文献
17.
Traffic dynamics based on a traffic awareness routing strategy on scale-free networks 总被引:1,自引:0,他引:1
By incorporating local traffic information into the shortest path routing strategy, we numerically investigate the effectiveness of the traffic awareness routing strategy for scale-free networks with different clustering. In order to characterize the efficiency of the packet-delivery process, we introduce an order parameter and an average transmission time that allow us to measure the network capacity by the critical value of phase transition from free flow to congestion. Compared with the shortest path routing protocol, the network capacity is greatly enhanced by the traffic awareness routing strategy. We also find that there exists an optimum value for the tunable parameter in the congestion awareness strategy. Moreover, simulation results show that the more clustered the network, the less efficient the packet-delivery process. 相似文献
18.
L. Tian D.-N. Shi 《The European Physical Journal B - Condensed Matter and Complex Systems》2007,56(2):167-171
In this paper, we study a rank-based model for weighted network. The evolution rule of the network is based on the ranking
of node strength, which couples the topological growth and the weight dynamics. Analytically and by simulations, we demonstrate
that the generated networks recover the scale-free distributions of degree and strength in the whole region of the growth
dynamics parameter (α>0). Moreover, this network evolution mechanism can also produce scale-free property of weight, which
adds deeper comprehension of the networks growth in the presence of incomplete information. We also characterize the clustering
and correlation properties of this class of networks. It is showed that at α=1 a structural phase transition occurs, and for
α>1 the generated network simultaneously exhibits hierarchical organization and disassortative degree correlation, which is
consistent with a wide range of biological networks. 相似文献
19.
<正>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. 相似文献
20.
Yukio Hayashi 《Physica A》2009,388(6):991-998
Robust and efficient design of networks on a realistic geographical space is one of the important issues for the realization of dependable communication systems. In this paper, based on a percolation theory and a geometric graph property, we investigate such a design from the following viewpoints: (1) network evolution according to a spatially heterogeneous population, (2) trimodal low degrees for the tolerant connectivity against both failures and attacks, and (3) decentralized routing within short paths. Furthermore, we point out the weakened tolerance by geographical constraints on local cycles, and propose a practical strategy by adding a small fraction of shortcut links between randomly chosen nodes in order to improve the robustness to a similar level to that of the optimal bimodal networks with a larger degree for the network size N. These properties will be useful for constructing future ad hoc networks in wide-area communications. 相似文献