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.
traffic capacity betweenness routing scale-free networks
Liuqing Chen Jinchun Gao Gang Xie Haiyang Liu Yuanan Liu
Beijing University of Posts and Telecommunications Beijing 100876, China
国际会议
重庆
英文
110-113
2015-12-19（万方平台首次上网日期，不代表论文的发表时间）