An improved local efficient routing strategy on scale-free networks

被引:0
作者
Ma, Jinlong [1 ]
Wei, Jindong [1 ]
Ma, Jiaxin [1 ]
Lu, Zhijia [2 ]
机构
[1] Hebei Univ Sci & Technol, Sch Informat Sci & Engn, Shijiazhuang 050018, Peoples R China
[2] Shijiazhuang Univ, Mech & Elect Coll, Shijiazhuang 050035, Peoples R China
来源
INTERNATIONAL JOURNAL OF MODERN PHYSICS C | 2023年 / 34卷 / 09期
关键词
Scale-free networks; traffic capacity; routing strategy; robustness; TRAFFIC DYNAMICS; COMPLEX NETWORKS;
D O I
10.1142/S0129183123501231
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
To improve the traffic capacity of scale-free networks, we propose an improved local efficient routing (ILER) strategy based on node degree and network constraint index (NCI). NCI describes how closely a node is maintained directly or indirectly with other nodes, and it only considers the relationship between nodes and their neighbors, not the topology of the network. Both the node degree and NCI are a parameter to describe the importance of nodes, and the combination of the two can make up for their own shortcomings, making it particularly important. Under the ILER strategy, packets can bypass some central nodes in the network for transmission, so that the central nodes in the network are not prone to congestion, thereby increasing the network traffic capacity. Through simulation comparison, the network traffic capacity under ILER strategy is significantly higher than that under probability routing (PR) strategy and efficient routing (ER) strategy. Under the ILER strategy, the average path length (APL) of the network is also shorter than that under the PR and ER strategies. In addition, whether target attack or random attack, the network has strong robustness under ILER strategy.
引用
收藏
页数:14
相关论文
共 42 条
[1]   Structural vulnerability of the North American power grid [J].
Albert, R ;
Albert, I ;
Nakarado, GL .
PHYSICAL REVIEW E, 2004, 69 (02) :025103-1
[2]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[3]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[4]  
ALBERT SR, 2019, J PHYS G NUCL PARTIC, V21
[5]   Effects of rewiring strategies on information spreading in complex dynamic networks [J].
Ally, Abdulla F. ;
Zhang, Ning .
COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2018, 57 :97-110
[6]   Modeling the coupling between a COVID-19-like epidemic and the economy [J].
Aucouturier, Matthieu ;
Herrmann, Hans J. .
INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2021, 32 (11)
[7]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[8]   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
[9]   Graph structure in the Web [J].
Broder, A ;
Kumar, R ;
Maghoul, F ;
Raghavan, P ;
Rajagopalan, S ;
Stata, R ;
Tomkins, A ;
Wiener, J .
COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2000, 33 (1-6) :309-320
[10]   Optimal transport on complex networks [J].
Danila, Bogdan ;
Yu, Yong ;
Marsh, John A. ;
Bassler, Kevin E. .
PHYSICAL REVIEW E, 2006, 74 (04)