Traffic and routing on a weighted scale-free network model

Inspired by previous local routing strategies, we propose a new routing strategy based on the local topological information in weighted 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 strength of the next node but also the controlled parameter. The routing algorithm is implemented in the weighted scale-free networks with triad formation in the case of nodes´ delivering ability proportional to its strength. Simulations show that the maximal network capacity corresponds to an optimal controlled parameter.