AN EFFICIENT WEIGHTED ROUTING STRATEGY FOR SCALE-FREE NETWORKS.

Considering the link congestion based traffic model, which can more accurately model the traffic diffusing process of many real complex systems such as the Internet, we propose an efficient weighted routing strategy in which each link's weight is assigned with the edge betweenness of the original un-weighted network with a tunable parameter α. As the links with the highest edge betweenness are susceptible to traffic congestion, our routing strategy efficiently redistribute the heavy traffic load from central links to noncentral links. The highest traffic capacity under this new routing strategy is achieved when compared with the shortest path routing strategy and the efficient routing strategy. Moreover, the average path length of our routing strategy is much smaller than that of the efficient routing strategy. Therefore, our weighted routing strategy is preferable to other routing strategies and can be easily implemented through software method. [ABSTRACT FROM AUTHOR]