An incremental optimal routing strategy for scale-free networks

Abstract

The link congestion based traffic model can more accurately reveal the traffic dynamics of many real complex networks such as the Internet, and heuristically optimizing each link's weight for the shortest path routing strategy can strongly improve the traffic capacity of network. In this work, we propose an optimal routing strategy in which the weight of each link is regulated incrementally to enhance the network traffic capacity by minimizing the maximum link betweenness of any link in the network. We also estimate more suitable value of the tunable parameter β for the efficient routing strategy under the link congestion based traffic model. The traffic load of network can be significantly balanced at the expense of increasing a bit average path length or average traffic load.