Back to Search
Start Over
Efficient and robust routing on scale-free networks
- Source :
-
Physica A . Feb2012, Vol. 391 Issue 3, p866-871. 6p. - Publication Year :
- 2012
-
Abstract
- Abstract: 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 Yan et al. [Phys. Rev. E 73, 046108 (2006)]. Furthermore our routing strategy has strong robustness against cascading failure attacks on networks. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03784371
- Volume :
- 391
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Physica A
- Publication Type :
- Academic Journal
- Accession number :
- 67138554
- Full Text :
- https://doi.org/10.1016/j.physa.2011.08.044