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 ◽  
...  
2015 ◽  
Vol 29 (33) ◽  
pp. 1550212
Author(s):  
Xue-Jun Zhang ◽  
Yan-Bo Zhu ◽  
Xiang-Min Guan

Interconnections between networks make the traffic condition in interconnected networks more complicated than that in an isolated network. They make the load and capacity of nodes mismatch and restrict the traffic performance accordingly. To improve the performance, in this paper, we propose a hybrid routing strategy, which distinguishes the traffic within each individual network and the traffic across multiple networks and uses different routing rules for these two types of traffic. Simulation results show that this routing strategy can achieve better traffic performance than traditional strategies when networks are coupled by a small number of interconnected links, which is the case in most of real-world interconnected networks. Therefore, the proposed hybrid routing strategy can find applications in the planning and optimization of practical interconnected networks.


IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Jinlong Ma ◽  
Junfeng Zhang ◽  
Yongqiang Zhang

2013 ◽  
Vol 2013 ◽  
pp. 1-12
Author(s):  
Wei Huang ◽  
Xiang Pan ◽  
Xi Yang ◽  
Jianhua Zhang

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.


2011 ◽  
Vol 20 (8) ◽  
pp. 080501 ◽  
Author(s):  
Si-Yuan Zhou ◽  
Kai Wang ◽  
Yi-Feng Zhang ◽  
Wen-Jiang Pei ◽  
Cun-Lai Pu ◽  
...  

2017 ◽  
Vol 468 ◽  
pp. 205-211 ◽  
Author(s):  
Zhong-Yuan Jiang ◽  
Jian-Feng Ma ◽  
Yu-Long Shen

2013 ◽  
Vol 392 (4) ◽  
pp. 953-958 ◽  
Author(s):  
Xiaojun Zhang ◽  
Zishu He ◽  
Zheng He ◽  
Lez Rayman-Bacchus

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 19782-19791 ◽  
Author(s):  
Xiong Gao ◽  
Hongxiang Guo ◽  
Yanhu Chen ◽  
Yinan Tang ◽  
Cen Wang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document