Efficient routing on scale-free networks based on local information

Abstract

In this Letter, we propose a new routing strategy with a single tunable parameter α only based on local information of network topology. The probability that a given node i with degree k i receives packets from its neighbors is proportional to k i α . In order to maximize the packets handling capacity of underlying structure that can be measured by the critical point of continuous phase transition from free flow to congestion, the optimal value of α is sought out. Through investigating the distributions of queue length on each node in free state, we give an explanation why the delivering capacity of the network can be enhanced by choosing the optimal α. Furthermore, dynamic properties right after the critical point are also studied. Interestingly, it is found that although the system enters the congestion state, it still possesses partial delivering capability which does not depend on α. This phenomenon suggests that the capacity of the scale-free network can be enhanced by increasing the forwarding ability of small important nodes which bear severe congestion.