Efficient and robust routing on scale-free networks

Cun-Lai Pu, Si-Yuan Zhou, Kai Wang, Yi-Feng Zhang and Wen-Jiang Pei

Physica A: Statistical Mechanics and its Applications, 2012, vol. 391, issue 3, 866-871

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.

Keywords: Network capacity; Routing; Scale-free networks (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437111006728
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:391:y:2012:i:3:p:866-871

DOI: 10.1016/j.physa.2011.08.044

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().