Routing on a weighted scale-free network

Mao-Bin Hu, Rui Jiang, Yong-Hong Wu, Wen-Xu Wang and Qing-Song Wu

Physica A: Statistical Mechanics and its Applications, 2008, vol. 387, issue 19, 4967-4972

Abstract: In this paper, the packet traffic flow on weighted scale-free networks is investigated based on the local routing strategy using link weights: Pl→i=wliα∑jwljα. The capacity of links is controlled by max(βwlj,1), and the capacity of nodes is controlled by node strength: max(γsi,1). It is shown by simulations that the traffic dynamics depends strongly on the navigation parameters. These behaviors can be explained by investigating the average number of packets on nodes and delivered through links.

Keywords: Weighted scale-free networks; Routing strategy; Traffic capacity (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437108004020
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:387:y:2008:i:19:p:4967-4972

DOI: 10.1016/j.physa.2008.04.030

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