An incremental optimal routing strategy for scale-free networks

Abstract

The link congestion based tra±c model can more accurately reveal the tra±c 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 tra±c 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 tra±c 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 e±cient routing strategy under the link congestion based tra±c model. The tra±c load of network can be signi¯cantly balanced at the expense of increasing a bit average path length or average tra±c load.