General local routing on complex networks

Abstract

Motivated by the problem of traffic congestion in large communication networks, three kinds of general local routing strategies are proposed respectively based on local topological, dynamic information and the estimated waiting time for enhancing the efficiency of traffic delivery on scale-free networks. The three strategies are governed separately by a single parameter. Simulations show that the maximal network capacity corresponds to an optimal controlled parameter. Moreover, a simulation is performed in a model of scale-free network with different clustering coefficient, and the results revealed that the more clustered network, the less efficient the packet delivery process. © 2012 Springer-Verlag Berlin Heidelberg.