会议专题

Comprehensive Routing Strategy in Scale-free Networks based on Random Walks

We propose a new routing strategy to enhance the transport capability on complex networks. Compared with the shortest routing strategy- and the efficient routing strategy, our routing strategy makes the load distributed more uniformly in the network by adjusting the parameter in the cost function. Our results suggest that two key indexes (the critical value and the average path length) of the transport capability- of network can both be optimized under our routing strategy.

complex network random walk routing strategy

Siyuan Zhou Kai Wang Yifeng Zhang Wenjiang Pei

School of Information Science and Engineering Southeast University Nanjing,China

国际会议

2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

太原

英文

243-246

2011-02-26(万方平台首次上网日期,不代表论文的发表时间)