Optimal routing strategy based on the minimum information path

In this paper, we propose a new routing strategy based on the minimum information path, named the optimal routing (OR) strategy, to improve the transportation capacity of scale-free networks. We define the average routing centrality degree of the node to analyze the traffic load on nodes of different degree. We analyze the transportation capacity by using the critical values of R c , the average packet travel time, and the average path length. Both theoretical and experimental results show that the capacity of the network under our strategy will be maximized when the packet-delivery rate of the node is directly proportional to the degree.