A global routing method for weighted scale-free networks

Pu Cun-Lai, Pei Wen-Jiang, 东南大学信息科学与工程学院,南京 210096
2010 Wuli xuebao  
In this article, a global routing method is proposed for weighted scale-free networks. To bypass the central nodes and alleviate the congestion, it chooses the best route according to the minimum value of the cost function which is based on the node strength. Simulation results show that the network capacity is improved more than 10 times by our method than by the shortest path strategy at the cost of a slightly growth in the average path-length.
doi:10.7498/aps.59.3841 fatcat:t6aabqp4d5c2xpej7nlzeblehq