International Journal of Applied Information Systems |
Foundation of Computer Science (FCS), NY, USA |
Volume 7 - Number 10 |
Year of Publication: 2014 |
Authors: Yu Su, Tao Zhou, Shoubao Su |
10.5120/ijais14-451246 |
Yu Su, Tao Zhou, Shoubao Su . Optimal Routing Strategy on Weighted Networks. International Journal of Applied Information Systems. 7, 10 ( October 2014), 41-45. DOI=10.5120/ijais14-451246
How to improve the transfer capability of the weighted networks is one of the most important problems in complex networks. In this paper, a novel and effective routing strategy is proposed by deleting edges in proper order according to their different definitions of edge weight. Kicking out few specified edges can enhance the transfer capability of weighted networks greatly. Simulations on both compute generated and real world networks show that the routing strategy kicking out edges according to the product of the strengths of two nodes of the edge is more effective. Moreover, we analyse the curve of critical packet generation rate of kicking out all deletable edges and find that there is a sharp transition after kicking out some edges. Due to the strongly improved network capacity, easy realization on networks, and low cost, the strategy may be useful for real communication networks.