A dynamic routing strategy with limited buffer on scale-free network

2016 ◽  
Vol 89 (4) ◽  
Author(s):  
Yufei Wang ◽  
Feng Liu
2009 ◽  
pp. 733-738
Author(s):  
Mao-Bin Hu ◽  
Yong-Hong Wu ◽  
Rui Jiang ◽  
Qing-Song Wu ◽  
Wen-Xu Wang

2010 ◽  
Vol 19 (4) ◽  
pp. 040513 ◽  
Author(s):  
Liu Feng ◽  
Zhao Han ◽  
Li Ming ◽  
Ren Feng-Yuan ◽  
Zhu Yan-Bo

2015 ◽  
Vol 24 (9) ◽  
pp. 098903 ◽  
Author(s):  
Wei-Hao Xie ◽  
Bin Zhou ◽  
En-Xiao Liu ◽  
Wei-Dang Lu ◽  
Ting Zhou

2016 ◽  
Vol 30 (22) ◽  
pp. 1650302 ◽  
Author(s):  
Lina Sun ◽  
Ning Huang ◽  
Yue Zhang ◽  
Yannan Bai

An efficient routing strategy can deliver packets quickly to improve the network capacity. Node congestion and transmission path length are inevitable real-time factors for a good routing strategy. Existing dynamic global routing strategies only consider the congestion of neighbor nodes and the shortest path, which ignores other key nodes’ congestion on the path. With the development of detection methods and techniques, global traffic information is readily available and important for the routing choice. Reasonable use of this information can effectively improve the network routing. So, an improved global dynamic routing strategy is proposed, which considers the congestion of all nodes on the shortest path and incorporates the waiting time of the most congested node into the path. We investigate the effectiveness of the proposed routing for scale-free network with different clustering coefficients. The shortest path routing strategy and the traffic awareness routing strategy only considering the waiting time of neighbor node are analyzed comparatively. Simulation results show that network capacity is greatly enhanced compared with the shortest path; congestion state increase is relatively slow compared with the traffic awareness routing strategy. Clustering coefficient increase will not only reduce the network throughput, but also result in transmission average path length increase for scale-free network with tunable clustering. The proposed routing is favorable to ease network congestion and network routing strategy design.


2009 ◽  
Vol 29 (5) ◽  
pp. 1230-1232
Author(s):  
Hao RAO ◽  
Chun YANG ◽  
Shao-hua TAO

Sign in / Sign up

Export Citation Format

Share Document