Improving robustness of complex networks by a new capacity allocation strategy

2020 ◽  
Author(s):  
Jun Liu
2018 ◽  
Vol 32 (05) ◽  
pp. 1850054 ◽  
Author(s):  
Jinlong Ma ◽  
Lixin Wang ◽  
Sufeng Li ◽  
Congwen Duan ◽  
Yu Liu

We study the traffic dynamics on two-layer complex networks, and focus on its delivery capacity allocation strategy to enhance traffic capacity measured by the critical value [Formula: see text]. With the limited packet-delivering capacity, we propose a delivery capacity allocation strategy which can balance the capacities of non-hub nodes and hub nodes to optimize the data flow. With the optimal value of parameter [Formula: see text], the maximal network capacity is reached because most of the nodes have shared the appropriate delivery capacity by the proposed delivery capacity allocation strategy. Our work will be beneficial to network service providers to design optimal networked traffic dynamics.


Author(s):  
Xing-Li Jing ◽  
Mao-Bin Hu ◽  
Cong-Ling Shi ◽  
Xiang Ling

The study of traffic dynamics on couple networks is important for the design and management of many real systems. In this paper, an efficient routing strategy on coupled spatial networks is proposed, considering both traffic characteristics and network topology information. With the routing strategy, the traffic capacity can be greatly improved in both scenarios of identical and heterogeneous node capacity allocation. Heterogeneous allocation strategy of node delivery capacity performs better than identical capacity allocation strategy. The study can help to improve the performance of real-world multi-modal traffic systems.


2014 ◽  
Vol 28 (02) ◽  
pp. 1450011 ◽  
Author(s):  
WEN-LI FAN ◽  
ZHI-GANG LIU ◽  
PING HU

In this paper, we investigate the trade-off problem between the high robustness against cascading failures and the low costs of network constructions in complex networks. Since the important nodes with highly connected components usually play a key role in the network structure and network dynamics, we propose an optimal capacity allocation model based on node importance. The novel model will increase the capacities of those important nodes but reduce the network construction cost with the appropriate capacity allocation parameter. Moreover, we also discover that our matching model can enhance the robustness against cascading failures on the IEEE 300 network.


2019 ◽  
Vol 31 (02) ◽  
pp. 2050029
Author(s):  
Jinlong Ma ◽  
Wei Sui ◽  
Changfeng Du ◽  
Xiangyang Xu ◽  
Guanghua Zhang

The traffic dynamics of complex networks are largely determined by the node’s resource distribution. In this paper, based on the shortest path routing strategy, a node delivering capacity distribution mechanism is proposed into the traffic dynamics in Barabási and Albert (BA) scale-free networks; the efficiency of the mechanism on the network capacity measured by the critical point ([Formula: see text]) of phase transition from free flow to congestion is primarily explored. Based on the proposed strategy, the total delivering capacity is reallocated according to both degree and betweenness of each node, and an optimal value of parameter [Formula: see text] is found, leading to the maximum traffic capacity. The results of numerical experiments on scale-free networks suggest that the resource allocation strategy proposed here is capable of effectively enhancing the transmission capacity of networks. Furthermore, this study may provide novel insights into research on networked traffic systems.


Author(s):  
Reuven Cohen ◽  
Shlomo Havlin
Keyword(s):  

1980 ◽  
Vol 50 (3) ◽  
pp. 829-830 ◽  
Author(s):  
BRIAN R. CLIFFORD ◽  
DAVID PRIOR

Sign in / Sign up

Export Citation Format

Share Document