Efficient and robust routing on scale-free networks
Efficient and robust routing on scale-free networks
复制标题
无标度网络上高效、稳健的路由
DOI：
10.1016/j.physa.2011.08.044
复制
发表时间：
2012-02-01
影响因子：
3.3
通讯作者：
Pei, Wen-Jiang
中科院分区：
文献类型：
--
作者：
Pu, Cun-Lai;Zhou, Si-Yuan;Pei, Wen-Jiang
Information routing is one of the most important problems in large communication networks. In this paper we propose a novel routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates degrees of nodes in paths. Results on large scale-free networks demonstrate that our routing strategy is more efficient than the shortest path algorithm and the efficient routing strategy proposed by Van et al. [Phys. Rev. E 73, 046108 (2006)]. Furthermore our routing strategy has strong robustness against cascading failure attacks on networks. (C) 2011 Elsevier B.V. All rights reserved.
