An Efficient Strategy to Improve Traffic Capacity of the Scale-free Network by Link-directed Method

被引:5
作者
Cui, Jiabao [1 ]
Xiang, Ju [2 ,3 ,4 ]
Liu, Yang [1 ]
Hu, Ke [1 ]
Tang, Yi [1 ]
机构
[1] Xiangtan Univ, Phys & Optoelect Dept, Xiangtan 411100, Hunan, Peoples R China
[2] Changsha Med Univ, Neurosci Res Ctr, Changsha 410219, Hunan, Peoples R China
[3] Changsha Med Univ, Dept Basic Med Sci, Changsha 410219, Hunan, Peoples R China
[4] Cent South Univ, Sch Comp Sci & Engn, Changsha 410083, Hunan, Peoples R China
基金
中国国家自然科学基金;
关键词
D O I
10.7566/JPSJ.89.014802
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
How to improve traffic handing capacity of network is one of the important problems in network science due to its important implication for various modern communication networks. In this paper, we present an efficient method to enhance the traffic capacity of network via the process of enforcing a fraction of the undirected links to be unidirectional based on the degree and betweenness of nodes, which we name the high-betweenness-degree-first method. Extensive simulations have been performed to estimate the effectiveness of the proposed method under the shortest path routing strategy. It is found that our proposed method can result in higher transmission efficiency compared to the high-degree-first and high-betweenness-first methods. Due to the strongly improved traffic capacity, this work may be helpful to design and optimize the structures of various communication networks.
引用
收藏
页数:5
相关论文
共 40 条
[1]   Communication in networks with hierarchical branching [J].
Arenas, A ;
Díaz-Guilera, A ;
Guimerà, R .
PHYSICAL REVIEW LETTERS, 2001, 86 (14) :3196-3199
[2]   Effective hybrid link-adding strategy to enhance network transport efficiency for scale-free networks [J].
Bai, Yiguang ;
Liu, Sanyang ;
Zhang, Zhaohui .
INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2017, 28 (08)
[3]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[4]   Enhancing network capacity by weakening community structure in scale-free network [J].
Cai, Jun ;
Wang, Yu ;
Liu, Yan ;
Luo, Jian-Zhen ;
Wei, Wenguo ;
Xu, Xiaoping .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2018, 87 :765-771
[5]   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
[6]   Traffic Dynamics on Complex Networks: A Survey [J].
Chen, Shengyong ;
Huang, Wei ;
Cattani, Carlo ;
Altieri, Giuseppe .
MATHEMATICAL PROBLEMS IN ENGINEERING, 2012, 2012
[7]  
Faloutsos M, 1999, COMP COMM R, V29, P251, DOI 10.1145/316194.316229
[8]   Routing in scale-free networks based on expanding betweenness centrality [J].
Guan, Zhi-Hong ;
Chen, Long ;
Qian, Tong-Hui .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2011, 390 (06) :1131-1138
[9]   Optimal network topologies for local search with congestion -: art. no. 248701 [J].
Guimerà, R ;
Díaz-Guilera, A ;
Vega-Redondo, F ;
Cabrales, A ;
Arenas, A .
PHYSICAL REVIEW LETTERS, 2002, 89 (24) :248701-248701
[10]  
Holme Petter, 2002, Phys Rev E Stat Nonlin Soft Matter Phys, V65, P066109