A minimal model for congestion phenomena on complex networks
From MaRDI portal
Publication:3301104
DOI10.1088/1742-5468/2009/08/P08023zbMATH Open1459.90051arXiv0906.3945OpenAlexW2051369938WikidataQ60575081 ScholiaQ60575081MaRDI QIDQ3301104FDOQ3301104
Authors: D. De Martino, Luca Dall'Asta, Ginestra Bianconi, Matteo Marsili 
Publication date: 11 August 2020
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Abstract: We study a minimal model of traffic flows in complex networks, simple enough to get analytical results, but with a very rich phenomenology, presenting continuous, discontinuous as well as hybrid phase transitions between a free-flow phase and a congested phase, critical points and different scaling behaviors in the system size. It consists of random walkers on a queueing network with one-range repulsion, where particles can be destroyed only if they can move. We focus on the dependence on the topology as well as on the level of traffic control. We are able to obtain transition curves and phase diagrams at analytical level for the ensemble of uncorrelated networks and numerically for single instances. We find that traffic control improves global performance, enlarging the free-flow region in parameter space only in heterogeneous networks. Traffic control introduces non-linear effects and, beyond a critical strength, may trigger the appearance of a congested phase in a discontinuous manner. The model also reproduces the cross-over in the scaling of traffic fluctuations empirically observed in the Internet, and moreover, a conserved version can reproduce qualitatively some stylized facts of traffic in transportation networks.
Full work available at URL: https://arxiv.org/abs/0906.3945
Recommendations
- Optimal structure of complex networks for minimizing traffic congestion
- CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS
- Modeling epidemic spreading in complex networks: concurrency and traffic
- Properties of volume-capacity ratio in congested complex~networks
- LOAD DISTRIBUTION IN CONGESTED SCALE-FREE NETWORKS
- Traffic dynamics on complex networks: a survey
- Search and congestion in complex networks
Cites Work
- Nonequilibrium statistical mechanics of the zero-range process and related models
- Queueing Networks and Markov Chains
- Factorized steady states in mass transport models
- Information transfer and phase transitions in a model of internet traffic
- Efficient routing on scale-free networks based on local information
- Self-organized network flows
- Effects of economic interactions on credit risk
Cited In (11)
- Feedback-induced self-oscillations in large interacting systems subjected to phase transitions
- Traffic dynamics on complex networks
- Effective bandwidth of non-Markovian packet traffic
- Jamming and correlation patterns in traffic of information on sparse modular networks
- TRANSPORT ON COMPLEX NETWORKS: FLOW, JAMMING AND OPTIMIZATION
- FLUCTUATIONS IN URBAN TRAFFIC NETWORKS
- EXTENDED FIBER BUNDLE MODEL FOR TRAFFIC JAMS ON SCALE-FREE NETWORKS
- Extreme events in dynamical systems and random walkers: a review
- Network congestion analysis of gravity generated models
- CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS
- Modeling congestion considering sequential coupling applications: a network-cell-based method
This page was built for publication: A minimal model for congestion phenomena on complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301104)
