scholarly journals An Effective Local Routing Strategy on the Communication Network

2009 ◽  
pp. 1118-1123
Author(s):  
Yu-jian Li ◽  
Bing-hong Wang ◽  
Zheng-dong Xi ◽  
Chuan-yang Yin ◽  
Han-xin Yang ◽  
...  
Keyword(s):  
Communication Network ◽  
Routing Strategy ◽  
Local Routing

Traffic Dynamics Based on Local Routing Strategy in a Weighted Scale-Free Network

2009 ◽  
pp. 733-738
Author(s):  
Mao-Bin Hu ◽  
Yong-Hong Wu ◽  
Rui Jiang ◽  
Qing-Song Wu ◽  
Wen-Xu Wang
Keyword(s):  
Scale Free Network ◽  
Traffic Dynamics ◽  
Scale Free ◽  
Routing Strategy ◽  
Free Network ◽  
Local Routing

Adaptive local routing strategy on a scale-free network

2010 ◽  
Vol 19 (4) ◽  
pp. 040513 ◽  
Author(s):  
Liu Feng ◽  
Zhao Han ◽  
Li Ming ◽  
Ren Feng-Yuan ◽  
Zhu Yan-Bo
Keyword(s):  
Scale Free Network ◽  
Scale Free ◽  
Routing Strategy ◽  
Free Network ◽  
Local Routing

Design of Routing Strategy for SDN-based Power Communication Network

2021 ◽  
Author(s):  
Chao Fan ◽  
Yanyan Wang ◽  
Zhongping Wu ◽  
Mingxi Zhang ◽  
Menglan Zhou
Keyword(s):  
Communication Network ◽  
Routing Strategy

Greedy Local Routing Strategy for Autonomous Global Load Balancing Based on Three-Dimensional Potential Field

2010 ◽  
Vol 14 (9) ◽  
pp. 839-841 ◽  
Author(s):  
Sangsu Jung ◽  
Jihoon Sung ◽  
Yonghwan Bang ◽  
Malaz Kserawi ◽  
Hyeji Kim ◽  
...  
Keyword(s):  
Load Balancing ◽  
Potential Field ◽  
Three Dimensional ◽  
Routing Strategy ◽  
Local Routing

Greedy Routing on Complex Networks

2011 ◽  
Vol 403-408 ◽  
pp. 2453-2456
Author(s):  
Xin Ling Shi ◽  
Li Jun Zhang ◽  
Da Kuo Wang
Keyword(s):  
Complex Networks ◽  
Greedy Algorithm ◽  
Queue Length ◽  
Search Strategy ◽  
Greedy Routing ◽  
Dynamic Information ◽  
Routing Strategy ◽  
Local Routing

This paper proposes a new routing strategy on complex networks. Based on the idea of greedy algorithm, our routing strategy chooses the node that has the highest probability to reach destination with the studies of max degree search strategy. In the meantime, the dynamic information like queue length will affect influence our strategy in order to increase the capacity of network. The result of simulation shows our strategy has a better performance compare to other local routing strategy. This strategy can be used on different kinds of complex networks.

Sign in / Sign up

Export Citation Format

Share Document