Effective use of congestion in complex networks
Juan Echagüe,
Vicent Cholvi and
Dariusz R. Kowalski
Physica A: Statistical Mechanics and its Applications, 2018, vol. 494, issue C, 574-580
Abstract:
In this paper, we introduce a congestion-aware routing protocol that selects the paths according to the congestion of nodes in the network. The aim is twofold: on one hand, and in order to prevent the networks from collapsing, it provides a good tolerance to nodes’ overloads; on the other hand, and in order to guarantee efficient communication, it also incentivize the routes to follow short paths. We analyze the performance of our proposed routing strategy by means of a series of experiments carried out by using simulations. We show that it provides a tolerance to collapse close to the optimal value. Furthermore, the average length of the paths behaves optimally up to the certain value of packet generation rate ρ and it grows in a linear fashion with the increase of ρ.
Keywords: Complex networks; Routing strategies; Congestion control (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437117312402
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:494:y:2018:i:c:p:574-580
DOI: 10.1016/j.physa.2017.11.159
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 ().