Congestion phenomena on complex networks
arXiv:0808.0584 · doi:10.1103/PhysRevE.79.015101
Abstract
We define a minimal model of traffic flows in complex networks containing the most relevant features of real routing schemes, i.e. a trade--off strategy between topological-based and traffic-based routing. The resulting collective behavior, obtained analytically for the ensemble of uncorrelated networks, is physically very rich and reproduces results recently observed in traffic simulations on scale-free networks. We find that traffic control is useless in homogeneous graphs but may improves global performance in inhomogeneous networks, enlarging the free-flow region in parameter space. Traffic control also introduces non-linear effects and, beyond a critical strength, may trigger the appearance of a congested phase in a discontinuous manner.
4 pages, 4 figures, submitted to PRL
References in corpus (18)
- Epidemic spreading in scale-free networks
- Cascade control and defense in complex networks
- The Network Analysis of Urban Streets: A Primal Approach
- k-core organization of complex networks
- Efficient routing on complex networks
- Optimal network topologies for local search with congestion
- Communication in networks with hierarchical branching
- Fluctuations in network dynamics
- Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations
- Dynamics of jamming transitions in complex networks
- Efficient routing on scale-free networks based on local information
- On the universality of the scaling of fluctuations in traffic on complex networks
- Scaling breakdown in flow fluctuations on complex networks
- Multiscaling and non-universality in fluctuations of driven complex systems
- Scale-free behavior of the Internet global performance
- Network traffic behaviour near phase transition point
- Adaptive drivers in a model of urban traffic
- Effects of Economic Interactions on Credit Risk
Cited by in corpus (30)
- The structure and dynamics of multilayer networks
- Recent advances in percolation theory and its applications
- Explosive Phenomena in Complex Networks
- Traffic congestion in interconnected complex networks
- Avoiding a Spanning Cluster in Percolation Models
- Extreme events in dynamical systems and random walkers: A review
- Extreme events on complex networks
- Mobility and Congestion in Dynamical Multilayer Networks with Finite Storage Capacity
- A model to identify urban traffic congestion hotspots in complex networks
- Extreme events and event size fluctuations in biased random walks on networks
- Comprehensive routing strategy on multilayer networks
- Local Empathy provides Global Minimization of Congestion in Communication Networks
- A minimal model for congestion phenomena on complex networks
- Hopping in the crowd to unveil network topology
- Percolation on interdependent networks with a fraction of antagonistic interactions
- Manipulation of extreme events on scale-free networks
- On the Clausius formulation of the second law in stationary chemical networks through the theorems of the alternative
- Self Avoiding Paths Routing Algorithm in Scale-Free Networks
- Global efficiency and network structure of urban traffic flows: A percolation-based empirical analysis
- Fair sharing of resources in a supply network with constraints
- Temporally correlated zero-range process with open boundaries: Steady state and fluctuations
- Failure mechanisms of load sharing complex systems
- Variational Approach for the Effects of Periodic Modulations on the Spectrum of Massless Dirac Fermion
- Integrating fluctuations into distribution of resources in transportation networks
- Theoretical approach and impact of correlations on the critical packet generation rate in traffic dynamics on complex networks
- A link model approach to identify congestion hotspots
- The effect of network structure on phase transitions in queuing networks
- Effective bandwidth of non-Markovian packet traffic
- Random walk with priorities in communication-like networks
- Traffic properties for stochastic routings on scale-free networks