Dissemination of information in complex networks with congestion

Vicent Cholvi

Physica A: Statistical Mechanics and its Applications, 2006, vol. 366, issue C, 571-577

Abstract: We address the problem of message transfer in complex networks with congestion. We propose a new strategy aimed at improving routing efficiency. Such a strategy, contrary to the shortest available path length from a given source to its destination (perhaps the most widely analyzed routing strategy), takes into account the congestion of nodes and can be deployed, with a minimal overhead, on top of it. Our results show that, by distributing more homogeneously the congestion of nodes, it significantly reduces the average network load as well as the collapse point.

Keywords: Complex networks; Routing strategies; Congestion control (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437105011313
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:366:y:2006:i:c:p:571-577

DOI: 10.1016/j.physa.2005.10.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 ().