In this paper, an optimal routing strategy is proposed to enhance the traffic capacity of complex networks. In order to avoid nodes overloading, the new algorithm is derived on the basis of generalized betweenness centrality which gives an estimate of traffic handled by the node for a route set. Since the nodes with large betweenness centrality are more susceptible to traffic congestion, the traffic can be improved, as our strategy, by redistributing traffic load from nodes with large betweenness centrality to nodes with small betweenness centrality in the proceeding of computing collective routing table. Particularly, depending on a parameter that controls the optimization scale, the new routing can not only enlarge traffic capacity of networks more, but also enhance traffic efficiency with smaller average path length. Comparing results of previous routing strategies, it is shown that the present improved routing performs more effectively. © 2012 Elsevier B.V. All rights reserved.
CITATION STYLE
Chen, L., Chen, J., Guan, Z. H., Zhang, X. H., & Zhang, D. X. (2012). Optimization of transport protocols in complex networks. Physica A: Statistical Mechanics and Its Applications, 391(11), 3336–3341. https://doi.org/10.1016/j.physa.2012.01.003
Mendeley helps you to discover research relevant for your work.