Open AccessA global routing method for weighted scale-free networks
Author(s) -
Cunlai Pu,
Wei Pei
Publication year - 2010
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.59.3841
Subject(s) - computer science , shortest path problem , node (physics) , routing (electronic design automation) , path (computing) , scale free network , mathematical optimization , function (biology) , scale (ratio) , average path length , private network to network interface , value (mathematics) , path vector protocol , complex network , static routing , routing protocol , mathematics , computer network , theoretical computer science , graph , physics , quantum mechanics , evolutionary biology , biology , world wide web , structural engineering , machine learning , engineering
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.