A LOCAL INFORMATION-BASED ROUTING STRATEGY ON THE SCALE-FREE NETWORK

Abstract

The efficiency of a routing strategy on complex networks can be reflected by two measurements, i.e. the system capacity and the average data packets travel time. In this paper, we propose a new routing strategy which is only based on local information of network topology. This strategy integrated the delivering capability and packets queue length of nodes for enhancing the efficiency of traffic on scale-free networks. The probability that a given node i with delivering capability Ci receives packets from its neighbors is proportional to (Ni+1)/Ci and Ni is the packets queue length of the node i. Simulation results show that there exists an optimal value by maximizing the networks delivering capability and minimizing the packet travel time. We simulated the strategy on BA network with different m (connectivity density) values and the results show that our strategy is more efficient than other local information-based routing strategies.