Effective hybrid link-adding strategy to enhance network transport efficiency for scale-free networks

被引:14
作者
Bai, Yiguang [1 ]
Liu, Sanyang [1 ]
Zhang, Zhaohui [1 ]
机构
[1] Xidian Univ, Sch Math & Stat, Xian 710071, Shaanxi, Peoples R China
来源
INTERNATIONAL JOURNAL OF MODERN PHYSICS C | 2017年 / 28卷 / 08期
基金
中国国家自然科学基金;
关键词
Scale-free networks; transport capacity; link-adding strategy; betweenness centrality; congestion; BANDWIDTH ALLOCATION; COMPLEX; ROBUSTNESS; ALGORITHM;
D O I
10.1142/S0129183117501078
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, we propose a new strategy (HLS) to enhance the transport capacity of scale-free networks by adding links to the existing networks, based on the betweenness of nodes, the shortest path length and the betweenness of links. Since only slight amounts of nodes in scale-free networks have high betweenness centrality, local link-adding strategy is adopted as a part of HLS for target nodes, which can significantly reduce the load of target nodes. Moreover, in order to improve the robustness of our strategy under some extreme cases, second sorting procedure is introduced in HLS. Simulation results show that HLS outperforms the IE strategy in terms of transport capacity and delivering ability of scale-free networks. After the adding links process of HLS, the congestion can be alleviated efficiently, which is meaningful to the realistic networks.
引用
收藏
页数:13
相关论文
共 49 条
[1]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[2]   Communication in networks with hierarchical branching [J].
Arenas, A ;
Díaz-Guilera, A ;
Guimerà, R .
PHYSICAL REVIEW LETTERS, 2001, 86 (14) :3196-3199
[3]  
Barabasi A.-L., 2003, PHYS TODAY, V6, P243
[4]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[5]   Spatial networks [J].
Barthelemy, Marc .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2011, 499 (1-3) :1-101
[6]   Complex networks: Structure and dynamics [J].
Boccaletti, S. ;
Latora, V. ;
Moreno, Y. ;
Chavez, M. ;
Hwang, D. -U. .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2006, 424 (4-5) :175-308
[7]   A faster algorithm for betweenness centrality [J].
Brandes, U .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 2001, 25 (02) :163-177
[8]   Improving the network robustness against cascading failures by adding links [J].
Cao, Xian-Bin ;
Hong, Chen ;
Du, Wen-Bo ;
Zhang, Jun .
CHAOS SOLITONS & FRACTALS, 2013, 57 :35-40
[9]   Traffic Dynamics on Complex Networks: A Survey [J].
Chen, Shengyong ;
Huang, Wei ;
Cattani, Carlo ;
Altieri, Giuseppe .
MATHEMATICAL PROBLEMS IN ENGINEERING, 2012, 2012
[10]   Optimal transport on complex networks [J].
Danila, Bogdan ;
Yu, Yong ;
Marsh, John A. ;
Bassler, Kevin E. .
PHYSICAL REVIEW E, 2006, 74 (04)