A modified optimal routing strategy based on random walk on complex networks

In our original contributions, we found that the time which a random walker spends in finding a given path is directly proportional to the continued product of the degrees of all the nodes which pass through the given path. In this paper, with our original contributions, we give a modified routing strategy to improve the capacity of the network when all nodes have the same packet-delivery rates. We define an average routing centrality degree of the node to analyze the traffic load on the node with different degrees, and then we analyze the transportation capacity by using the critical value of R, the average packet travel time, the average path length and the search information. Both theoretical and experimental results show that compared with the shortest path strategy and the efficient path strategy, the new strategy can enhance the network capability.