Efficient routing strategy on scale-free network based on local information

Recent studies indicate that many communication networks such as the Internet and WWW are scale-free networks. Therefore, the study of routing strategy on a scale-free network is of practical significance, and worthy of further study. In this paper, a new routing strategy with a tunable parameter β is proposed. It is based on the node´s delivering ability and queue information of a scale-free network. Considering the existence of different handling and delivering ability of nodes, we assume that the node with larger degree has stronger delivering ability, making it proportional to the degree of the node. The network capacity is analyzed by using critical generation rate. Simulation shows that the optimal critical generation rate corresponds to β =-6. Compared with the strategy of adopting exclusive local static information, the new strategy shows its advantages in enhancing network capacity. Furthermore, the average path length of the new routing strategy is shorter than the traditional one when the package generation rate is relatively low or high.