Generalized minimum information path routing strategy on scale-free networks

2011 ◽  
Vol 20 (8) ◽  
pp. 080501 ◽  
Author(s):  
Si-Yuan Zhou ◽  
Kai Wang ◽  
Yi-Feng Zhang ◽  
Wen-Jiang Pei ◽  
Cun-Lai Pu ◽  
...  
Keyword(s):  
Minimum Information ◽  
Scale Free ◽  
Routing Strategy ◽  
Scale Free Networks

scholarly journals Effective gravitation path routing strategy on scale-free networks

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Jinlong Ma ◽  
Junfeng Zhang ◽  
Yongqiang Zhang
Keyword(s):  
Scale Free ◽  
Routing Strategy ◽  
Scale Free Networks

scholarly journals Distance-Based Routing Strategy for Traffic Transport in Spatial Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-12
Author(s):  
Wei Huang ◽  
Xiang Pan ◽  
Xi Yang ◽  
Jianhua Zhang
Keyword(s):  
Spatial Scale ◽  
Large Scale ◽  
Spatial Information ◽  
Good Choice ◽  
Spatial Distance ◽  
Greedy Routing ◽  
Scale Free ◽  
Routing Strategy ◽  
Scale Free Networks ◽  
Large Scale Networks

It is well known that routing strategies based on global topological information is not a good choice for the enhancement of traffic throughput in large-scale networks due to the heavy communication cost. On the contrary, acquiring spatial information, such as spatial distances among nodes, is more feasible. In this paper, we propose a novel distance-based routing strategy in spatial scale-free networks, called LDistance strategy. The probability of establishing links among nodes obeys the power-law in the spatial network under study. Compared with the LDegree strategy (Wang et al., 2006) and the mixed strategy (a strategy combining both greedy routing strategy and random routing strategy), results show that our proposed LDistance strategy can further enhance traffic capacity. Besides, the LDistance strategy can also achieve a much shorter delivering time than the LDegree strategy. Analyses reveal that the superiority of our strategy is mainly due to the interdependent relationship between topological and spatial characteristics in spatial scale-free networks. Furthermore, along transporting path in the LDistance strategy, the spatial distance to destination decays more rapidly, and the degrees of routers are higher than those in the LDegree strategy.

Check-in based routing strategy in scale-free networks

2017 ◽  
Vol 468 ◽  
pp. 205-211 ◽  
Author(s):  
Zhong-Yuan Jiang ◽  
Jian-Feng Ma ◽  
Yu-Long Shen
Keyword(s):  
Scale Free ◽  
Routing Strategy ◽  
Scale Free Networks

Probability routing strategy for scale-free networks

2013 ◽  
Vol 392 (4) ◽  
pp. 953-958 ◽  
Author(s):  
Xiaojun Zhang ◽  
Zishu He ◽  
Zheng He ◽  
Lez Rayman-Bacchus
Keyword(s):  
Scale Free ◽  
Routing Strategy ◽  
Scale Free Networks

ANALYSIS OF TRAFFIC FLOW ON COMPLEX NETWORKS

2011 ◽  
Vol 25 (10) ◽  
pp. 1419-1428 ◽  
Author(s):  
KUN LI ◽  
XIAOFENG GONG ◽  
SHUGUANG GUAN ◽  
C.-H. LAI
Keyword(s):  
Complex Networks ◽  
Network Capacity ◽  
Traffic Load ◽  
Packet Routing ◽  
Traffic Dynamics ◽  
Scale Free ◽  
Routing Strategy ◽  
Scale Free Networks ◽  
New Strategy ◽  
Mixed Networks

We propose a new routing strategy for controlling packet routing on complex networks. The delivery capability of each node is adopted as a piece of local information to be integrated with the load traffic dynamics to weight the next route. The efficiency of transport on complex network is measured by the network capacity, which is enhanced by distributing the traffic load over the whole network while nodes with high handling ability bear relative heavier traffic burden. By avoiding the packets through hubs and selecting next routes optimally, most travel times become shorter. The simulation results show that the new strategy is not only effective for scale-free networks but also for mixed networks in realistic networks.

scholarly journals Energy-based hybrid routing strategy for scale-free networks

2016 ◽  
Vol 65 (24) ◽  
pp. 248901
Author(s):  
Yang Xian-Xia ◽  
Pu Cun-Lai ◽  
Xu Zhong-Qi ◽  
Chen Rong-Bin ◽  
Wu Jie-Xin ◽  
...  
Keyword(s):  
Scale Free ◽  
Hybrid Routing ◽  
Routing Strategy ◽  
Scale Free Networks

scholarly journals EFFICIENT ROUTING ON SCALE-FREE NETWORKS

2007 ◽  
Vol 21 (23n24) ◽  
pp. 4071-4075 ◽  
Author(s):  
TAO ZHOU
Keyword(s):  
Traffic Congestion ◽  
Traffic Load ◽  
Fluctuation Analysis ◽  
Scale Free ◽  
Routing Strategy ◽  
Rate Fluctuation ◽  
Scale Free Networks ◽  
Traffic Rate ◽  
And Control ◽  
Detrended Fluctuation

The nodes with the largest degree are very susceptible to traffic congestion, thus an effective way to improve traffic and control congestion can be redistributing traffic load in hub nodes to others. We proposed an efficient routing strategy, which can remarkably enhance the network throughput. In addition, by using detrended fluctuation analysis, we found that the traffic rate fluctuation near the critical point exhibits the 1/f scaling in the power spectrum, which is in accordance with the empirical data.

Sign in / Sign up

Export Citation Format

Share Document