Routing strategy with waiting time on scale-free network

We study traffic dynamics and propose a new routing strategy based on the local topological information in scale-free network. According to the new routing strategy with a single tunable parameter, a packet is delivered to next node with probabilities that depend not only on the degrees of the next node but also the estimated waiting time at the new node. The routing algorithm is implemented in BA scale-free networks in the case of nodes´ delivering ability proportional to its degree. Simulations show that the maximal network capacity corresponds to an optimal controlled parameter.