Traffic congestion in dynamical network with finite storage capacity

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 d...

Full description

Saved in:
Bibliographic Details
Published in:Physica A 2020-05, Vol.545, p.123460, Article 123460
Main Authors: Ling, Xiang, Kong, Decong, Guo, Ning, Zhu, Kongjin, Long, Jiancheng
Format: Article
Language:English
Subjects:
Dynamic networks
Limited processing capability
Routing strategy
Traffic congestion
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. •Large packet generation rates will results in traffic congestion and abundant packet loss.•For each moving speed, there is an optimal packet generation rate to maximize network traffic.•The Braess’ paradox can be observed in our dynamic network model.
ISSN:0378-4371
1873-2119
DOI:10.1016/j.physa.2019.123460