We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Extended shortest path selection for package routing of complex networks.
- Authors
Ye, Fan; Zhang, Lei; Wang, Bing-Hong; Liu, Lu; Zhang, Xing-Yi
- Abstract
The routing strategy plays a very important role in complex networks such as Internet system and Peer-to-Peer networks. However, most of the previous work concentrates only on the path selection, e.g. Flooding and Random Walk, or finding the shortest path (SP) and rarely considering the local load information such as SP and Distance Vector Routing. Flow-based Routing mainly considers load balance and still cannot achieve best optimization. Thus, in this paper, we propose a novel dynamic routing strategy on complex network by incorporating the local load information into SP algorithm to enhance the traffic flow routing optimization. It was found that the flow in a network is greatly affected by the waiting time of the network, so we should not consider only choosing optimized path for package transformation but also consider node congestion. As a result, the packages should be transmitted with a global optimized path with smaller congestion and relatively short distance. Analysis work and simulation experiments show that the proposed algorithm can largely enhance the network flow with the maximum throughput within an acceptable calculating time. The detailed analysis of the algorithm will also be provided for explaining the efficiency.
- Subjects
DATA packeting; ROUTING (Computer network management); ROBOTIC path planning; LOAD balancing (Computer networks); MATHEMATICAL optimization
- Publication
International Journal of Modern Physics C: Computational Physics & Physical Computation, 2017, Vol 28, Issue 11, p-1
- ISSN
0129-1831
- Publication type
Article
- DOI
10.1142/S0129183117501297