Effective Gravitation Path Routing Strategy on Scale-Free Networks

被引:3
作者
Ma, Jinlong [1 ]
Zhang, Junfeng [1 ]
Zhang, Yongqiang [1 ]
机构
[1] Hebei Univ Sci & Technol, Sch Informat Sci & Engn, Shijiazhuang 050018, Hebei, Peoples R China
来源
IEEE ACCESS | 2021年 / 9卷
关键词
Complex networks; scale-free networks; congestion; traffic capacity; COMPLEX NETWORKS; CAPACITY; TRANSMISSION; CORE;
D O I
10.1109/ACCESS.2021.3093560
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Information routing strategy is a hot issue in the study of complex network traffic dynamics. In this paper, we define a new gravitational centrality and introduce parameter alpha(1) to control the centrality of nodes. When alpha(1) is appropriate value, the gravitational centrality has the function of dividing the centrality of the same degree nodes. According to the gravitational centrality, we propose an effective gravitation path routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates gravitational centrality of nodes in paths. The purpose of this strategy is to improve network traffic capacity. The simulation results on the scale-free networks show that our routing strategy is more effective than the efficient routing strategy proposed by Yan et al. [Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top. 73, 046108 (2006)].
引用
收藏
页码:96031 / 96038
页数:8
相关论文
共 43 条
[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]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[3]   Implantation of the global dynamic routing scheme in scale-free networks under the shortest path strategy [J].
Ben Haddou, N. ;
Ez-zahraouy, H. ;
Rachadi, A. .
PHYSICS LETTERS A, 2016, 380 (33) :2513-2517
[4]   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
[5]   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
[6]   Information transmission on hybrid networks [J].
Chen, Rongbin ;
Cui, Wei ;
Pu, Cunlai ;
Li, Jie ;
Ji, Bo ;
Gakis, Konstantinos ;
Pardalos, Panos M. .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 490 :524-532
[7]   Optimal topologies for maximizing network transmission capacity [J].
Chen, Zhenhao ;
Wu, Jiajing ;
Rong, Zhihai ;
Tse, Chi K. .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 495 :191-201
[8]   An Efficient Strategy to Improve Traffic Capacity of the Scale-free Network by Link-directed Method [J].
Cui, Jiabao ;
Xiang, Ju ;
Liu, Yang ;
Hu, Ke ;
Tang, Yi .
JOURNAL OF THE PHYSICAL SOCIETY OF JAPAN, 2020, 89 (01)
[9]   Optimal transport on complex networks [J].
Danila, Bogdan ;
Yu, Yong ;
Marsh, John A. ;
Bassler, Kevin E. .
PHYSICAL REVIEW E, 2006, 74 (04)
[10]   Global Hybrid Routing for Scale-Free Networks [J].
Gao, Xiong ;
Guo, Hongxiang ;
Chen, Yanhu ;
Tang, Yinan ;
Wang, Cen ;
Xu, Shengyao ;
Wu, Jian .
IEEE ACCESS, 2019, 7 :19782-19791