Routing to enhance traffic capacity for scale-free networks with tunable clustering

摘要

In this paper, for the optimization of transport on scale-free networks with tunable clustering, a new routing algorithm is investigated. The algorithm can balance the traffic on complex networks by minimizing the maximum node betweenness centrality in a small number of iteration steps for convergence and with little path lengthening. The simulations show that the traffic congestion is effectively alleviated and the traffic capacity is greatly enhanced in a model of scale-free networks with different clustering coefficients, the results also demonstrated that the more clustered network, the lower efficiency for the transportation of packets.