Effective usage of global dynamic information for network traffic

In this paper, we propose a routing strategy based on the global dynamic information of network traffic. In the strategy, packets will travel along the path with the minimal sum of links’ weight, which may vary with the traffic condition. During the whole evolution, if the queue length of a node exceeds a threshold, the link weight of its direct links will increase. Simulation results show that the maximal traffic capacity corresponds to an optimal value of the threshold. Furthermore, we compare the performance of the strategy with global dynamic (GD) routing strategy. It is found that the strategy can further improve the transport efficiency, especially in the congestion state. Our work may be helpful for the design of new routing strategies in networked traffic systems.