Optimal routing strategy based on the minimum information path

Kai Wang, Yifeng Zhang, Siyuan Zhou, Wenjiang Pei, Shaoping Wang and Tao Li

Physica A: Statistical Mechanics and its Applications, 2011, vol. 390, issue 13, 2593-2600

Abstract: In this paper, we propose a new routing strategy based on the minimum information path, named the optimal routing (OR) strategy, to improve the transportation capacity of scale-free networks. We define the average routing centrality degree of the node to analyze the traffic load on nodes of different degree. We analyze the transportation capacity by using the critical values of Rc, the average packet travel time, and the average path length. Both theoretical and experimental results show that the capacity of the network under our strategy will be maximized when the packet-delivery rate of the node is directly proportional to the degree.

Keywords: Complex network; Search information; Routing strategy (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437111000902
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:390:y:2011:i:13:p:2593-2600

DOI: 10.1016/j.physa.2011.01.026

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 ().