共查询到20条相似文献,搜索用时 31 毫秒
1.
相依网络的相依模式(耦合模式)是影响其鲁棒性的重要因素之一.本文针对具有无标度特性的两个子网络提出一种全局同质化相依网络耦合模式.该模式以子网络的总度分布均匀化为原则建立相依网络的相依边,一方面压缩度分布宽度,提高其对随机失效的抗毁性,另一方面避开对度大节点(关键节点)的相依,提高其对蓄意攻击的抗毁性.论文将其与常见的节点一对一的同配、异配及随机相依模式以及一对多随机相依模式作了对比分析,仿真研究其在随机失效和蓄意攻击下的鲁棒性能.研究结果表明,本文所提全局同质化相依网络耦合模式能大大提高无标度子网络所构成的相依网络抗级联失效能力.本文研究成果能够为相依网络的安全设计等提供指导意义. 相似文献
2.
Despite the large size of most communication and transportation systems,there are short paths between nodes in these networks which guarantee the efficient information,data and passenger delivery;furthermore these networks have a surprising tolerance under random errors thanks to their inherent scale-free topology.However,their scale-free topology also makes them fragile under intentional attacks,leaving us a challenge on how to improve the network robustness against intentional attacks without losing their strong tolerance under random errors and high message and passenger delivering capacity.Here we propose two methods (SL method and SH method) to enhance scale-free network’s tolerance under attack in different conditions. 相似文献
3.
This paper studies the resiliency of hierarchical networks when subjected to random errors, static attacks, and cascade attacks. The performance is compared with existing Erdös–Rényi (ER) random networks and Barabasi and Albert (BA) scale-free networks using global efficiency as the common performance metric. The results show that critical infrastructures modeled as hierarchical networks are intrinsically efficient and are resilient to random errors, however they are more vulnerable to targeted attacks than scale-free networks. Based on the response dynamics to different attack models, we propose a novel hybrid mitigation strategy that combines discrete levels of critical node reinforcement with additional edge augmentation. The proposed modified topology takes advantage of the high initial efficiency of the hierarchical network while also making it resilient to attacks. Experimental results show that when the level of damage inflicted on a critical node is low, the node reinforcement strategy is more effective, and as the level of damage increases, the additional edge augmentation is highly effective in maintaining the overall network resiliency. 相似文献
4.
《Physica A》2007
Networks generated by local-world evolving network model display a transition from exponential network to power-law network with respect to connectivity distribution. We investigate statistical properties of the evolving networks and the responses of these networks under random errors and intentional attacks. It has been found that local world size M has great effect on the network's heterogeneity, thus leading to transitional behaviors in network's robustness against errors and attacks. Numerical results show that networks constructed with local preferential attachment mechanism can maintain the robustness of scale-free networks under random errors and concurrently improve reliance against targeted attacks on highly connected nodes. 相似文献
5.
Two-peak and three-peak optimal complex networks 总被引:1,自引:0,他引:1
A central issue in complex networks is tolerance of random failures and intentional attacks. Current literature emphasizes the dichotomy between networks with a power-law node connectivity distribution, which are robust to random failures but fragile to targeted attacks, versus networks with an exponentially decaying connectivity distribution, which are less tolerant to failures but more resilient to attacks. We prove analytically that the optimal network configuration under a classic measure of robustness is altogether different from both of the above: in all cases, failure and/or attack, there are no more than three distinct node connectivities in the optimal network. 相似文献
6.
Recently, cities have become larger and larger, and more and more people are living in large cities. This phenomenon has caused serious traffic congestion which is very detrimental to the development of large cities. In this context, the subway has become the most effective solution for relieving traffic congestion and subways have been constructed in many cities, so the reliability and robustness of subways should be guaranteed. In this paper, Shanghai subway network, in China, will be analyzed and investigated; the topological characteristics and functional properties can be studied in order to assess the reliability and robustness. The topological characteristics can be measured using several parameters; meanwhile the fraction of removed nodes of Shanghai subway network is discussed and compared against that for a random network, and the critical threshold of this fraction is obtained. Two novel parameters called the functionality loss and connectivity of subway lines are proposed for measuring the transport functionality and the connectivity of subway lines. Subway lines 4 and 7 are selected as examples for evaluating the connectivity of lines subjected to different attack protocols. This study indicates that the subway network is robust against random attacks but fragile for malicious attacks, and the highest betweenness node-based attacks can cause the most serious damage to subway networks among the different attack protocols. 相似文献
7.
The robustness of urban bus network is essential to a city that heavily relies on buses as its main transportation solution. In this paper, the urban bus network has been modeled as a directed and space L network, and Changsha, a transportation hub of nearly 8 million people and hundreds of bus lines in southern China, is taken as a case. Based on the quantitative analyses of the topological properties, it is found that Changsha urban bus network is a scale-free network, not a small-world network. To evaluate the robustness of the network, five scenarios of network failure are simulated, including a random failure and four types of intentional attacks that differed in key node identification methods (i.e., unweighted degree or betweenness centrality) and attack strategies (i.e., normal or cascading attack). It is revealed that intentional attacks are more destructive than a random failure, and cascading attacks are more disruptive than normal attacks in the urban bus network. In addition, the key nodes identification methods are found to play a critical role in the robustness of the urban bus network. Specifically, cascading attack could be more disruptive when the betweenness centrality is used to identify key nodes; in contrast, normal attack could be more disruptive when the unweighted degree is used to identify key nodes. Our results could provide reference for risk management of urban bus network. 相似文献
8.
Optimization of robustness and connectivity in complex networks 总被引:2,自引:0,他引:2
Scale-free networks rely on a relatively small number of highly connected nodes to achieve a high degree of interconnectivity and robustness to random failure, but suffer from a high sensitivity to directed attack. In this paper we describe a parameterized family of networks and analyze their connectivity and sensitivity, identifying a network that has an interconnectedness closer to that of a scale-free network, a robustness to attack closer to that of an exponential network, and a resistance to failure better than that of either of those networks. 相似文献
9.
We numerically investigate the effect of four kinds of partial attacks of multiple targets on the Barabási Albert (BA) scale-free network and the Erdos-Rényi (ER) random network. Comparing with the effect of single target complete knockout we find that partial attacks of multiple targets may produce an effect higher than the complete knockout of a single target on both BA scale-free network and ER random network. We also find that the BA scale-free network seems to be more susceptible to multi-target partial attacks than the ER random network. 相似文献
10.
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. 相似文献
11.
A Robustness Model of Complex Networks with Tunable Attack Information Parameter 总被引:1,自引:0,他引:1
下载免费PDF全文
![点击此处可从《中国物理快报》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We introduce a novel model for robustness of complex with a tunable attack information parameter. The random failure and intentional attack known are the two extreme cases of our model. Based on the model, we study the robustness of complex networks under random information and preferential information, respectively. Using the generating function method, we derive the exact value of the critical removal fraction of nodes for the disintegration of networks and the size of the giant component. We show that hiding just a small fraction of nodes randomly can prevent a scale-free network from collapsing and detecting just a small fraction of nodes preferentially can destroy a scale-free network. 相似文献
12.
利用典型的Barabási-Albert无标度网络构建了基于度的正/负相关相依网络模型, 该模型考虑子网络间的相依方式及相依程度, 主要定义了两个参数F和K, F表示相依节点比例, K表示相依冗余度. 在随机攻击及基于度的蓄意攻击模式下, 针对网络的级联失效问题, 研究了不同的F值和K值对该相依网络模型鲁棒性的影响, 与随机相依网络模型进行了对比研究. 仿真结果表明:无论是随机相依或是基于度的正/负相关相依网络, 其鲁棒性都是随着F的增大而减弱, 随着K的增大而增强; 在随机攻击下, 全相依模式(F=1)时, 基于度正相关相依网络模型鲁棒性最优, 部分相依模式 (F =0.2, 0.5, 0.8)时, 基于度的负相关相依网络模型则表现出更好的鲁棒性. 而在基于度的蓄意攻击下, 无论F为何值, 基于度的正相关相依网络模型表现出弱鲁棒性. 相似文献
13.
Robustness analysis of static routing on networks 总被引:1,自引:0,他引:1
Robustness is one of the crucial properties that needs to be considered in the design of routing strategies on networks. We study the robustness of three typical routing strategies, which are the SP (shortest path), EP (efficient path), and OP (optimal path) strategies, by simulating several different kinds of attacks including random attacks, target attacks and cascading failures on scale-free networks. Results of the average path length, betweenness centrality, network capacity, etc., demonstrate that the EP strategy is more robust than the other two, and the OP strategy is more reliable than the SP strategy in general. However, on the power-grid network, the OP strategy is more resistant against cascading failures than the EP and SP strategies. 相似文献
14.
Yusupjan Habibulla 《理论物理通讯》2020,72(9):95602-139
The directed L-distance minimal dominating set (MDS) problem has wide practical applications in the fields of computer science and communication networks. Here, we study this problem from the perspective of purely theoretical interest. We only give results for an Erdós Rényi (ER) random graph and regular random (RR) graph, but this work can be extended to any type of network. We develop spin glass theory to study the directed 2-distance MDS problem. First, we find that the belief propagation (BP) algorithm does not converge when the inverse temperature β exceeds a threshold on either an ER random network or RR network. Second, the entropy density of replica symmetric theory has a transition point at a finite β on a regular random graph when the arc density exceeds 2 and on an ER random graph when the arc density exceeds 3.3; there is no entropy transition point (or $\beta =\infty $ ) in other circumstances. Third, the results of the replica symmetry (RS) theory are in agreement with those of BP algorithm while the results of the BP decimation algorithm are better than those of the greedy heuristic algorithm. 相似文献
15.
In this study, the robustness of small-world networks to three types of attack is investigated. Global efficiency is introduced as the network coefficient to measure the robustness of a small-world network. The simulation results prove that an increase in rewiring probability or average degree can enhance the robustness of the small-world network under all three types of attack. The effectiveness of simultaneously increasing both rewiring probability and average degree is also studied, and the combined increase is found to significantly improve the robustness of the small-world network.Furthermore, the combined effect of rewiring probability and average degree on network robustness is shown to be several times greater than that of rewiring probability or average degree individually. This means that small-world networks with a relatively high rewiring probability and average degree have advantages both in network communications and in good robustness to attacks. Therefore, simultaneously increasing rewiring probability and average degree is an effective method of constructing realistic networks. Consequently, the proposed method is useful to construct efficient and robust networks in a realistic scenario. 相似文献
16.
17.
Inspired by other related works, this paper proposes a non-linear load-capacity model against cascading failures, which is more suitable for real networks. The simulation was executed on the B-A scale-free network, E-R random network, Internet AS level network, and the power grid of the western United States. The results show that the model is feasible and effective. By studying the relationship between network cost and robustness, we find that the model can defend against cascading failures better and requires a lower investment cost when higher robustness is required. 相似文献
18.
E. Estrada 《The European Physical Journal B - Condensed Matter and Complex Systems》2006,52(4):563-574
We study the property of certain complex networks of being both sparse and
highly connected, which is known as “good expansion” (GE). A network has
GE properties if every subset S of nodes (up to 50% of the nodes) has a
neighborhood that is larger than some “expansion factor” φ
multiplied by the number of nodes in S. Using a graph spectral method we
introduce here a new parameter measuring the good expansion character of a
network. By means of this parameter we are able to classify 51 real-world
complex networks — technological, biological, informational, biological and
social — as GENs or non-GENs. Combining GE properties and node degree
distribution (DD) we classify these complex networks in four different
groups, which have different resilience to intentional attacks against their
nodes. The simultaneous existence of GE properties and uniform degree
distribution contribute significantly to the robustness in complex networks.
These features appear solely in 14% of the 51 real-world networks studied
here. At the other extreme we find that ∼40% of all networks are
very vulnerable to targeted attacks. They lack GE properties, display skewed
DD — exponential or power-law — and their topologies are changed more
dramatically by targeted attacks directed at bottlenecks than by the removal
of network hubs. 相似文献
19.
YIN Yan-Ping ZHANG Duan-Ming TAN Jin PAN Gui-Jun HE Min-Hua 《理论物理通讯》2008,49(3):797-800
We introduce a continuous weight attack strategy and numerically investigate the effect of continuous weight attack strategy on the Barabasi-Albert (BA) scale-free network and the Erdos-Rdnyi (ER) random network. We use a weight coefficient ω to define the attack intensity. The weight coefficient ω increases continuously from 1 to infinity, where 1 represents no attack and infinity represents complete destructive attack. Our results show that the continuous weight attack on two selected nodes with small ω (ω≈ 3) could achieve the same damage of complete elimination of a single selected node on both BA and ER networks. It is found that the continuous weight attack on a single selected edge with small ω (ω≈ 2) can reach the same effect of complete elimination of a single edge on BA network, but on ER network the damage of the continuous weight attack on a single edge is c/ose to but always smaller than that of complete elimination of edge even if ω is very large. 相似文献
20.
Yun-Yun Yang 《中国物理 B》2022,31(8):80201-080201
As a classical complex network model, scale-free network is widely used and studied. And motifs, as a high-order subgraph structure, frequently appear in scale-free networks, and have a great influence on the structural integrity, functional integrity and dynamics of the networks. In order to overcome the shortcomings in the existing work on the robustness of complex networks, only nodes or edges are considered, while the defects of high-order structure in the network are ignored. From the perspective of network motif, we propose an entropy of node degree distribution based on motif to measure the robustness of scale-free networks under random attacks. The effectiveness and superiority of our method are verified and analyzed in the BA scale-free networks. 相似文献