Optimal routing strategy based on the minimum information path

► We propose a new routing strategy based on the minimum information path 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 the node with different degrees. ► We analyze the transportation capacity by using the critical values of, the average packet travel time and the average path length.