Traffic congestion in dynamical network with finite storage capacity

Xiang Ling, Decong Kong, Ning Guo, Kongjin Zhu and Jiancheng Long

Physica A: Statistical Mechanics and its Applications, 2020, vol. 545, issue C

Abstract: As dynamic networks have received more and more attention, traffic congestion on dynamic networks has become a significant issue. In this paper, we introduce a model in which nodes with finite storage capacity move randomly in a closed square area. A routing strategy based on the closest Euclidean distance between any two nodes is proposed to transmit packets in the dynamic network. Large packet generation rates will results in traffic congestion and abundant packet loss. Large node capacity is also disadvantage to traffic. Moreover, we also find that for each moving speed, there will be an optimal packet generation rate to maximize network traffic. In our dynamic network model, the Braess’ paradox is observed.

Keywords: Dynamic networks; Routing strategy; Traffic congestion; Limited processing capability (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437119319302
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:545:y:2020:i:c:s0378437119319302

DOI: 10.1016/j.physa.2019.123460

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