Routing based on local dynamic queue information

The efficiency of traffic routing on complex networks can be reflected by the network capacity. In this paper, a new routing strategy is proposed based local dynamic information for enhancing the efficiency of traffic on scale-free networks. The strategy is governed by a single parameter. Simulation results show that maximizing the network capacity can generate an optimal parameter value. The detailed analysis of the new strategy is provided for explaining its effects on traffic routing. The work indicates that the capacity of the system with packets distribution follows the Poisson distribution is larger than that with packets distribution displays the power law.