Congestion and centrality in traffic flow on complex networks

Abstract

The central points of communication network flow has often been identified using graph theoretical centrality measures. In real networks, the state of traffic density arises from an interplay between the dynamics of the flow and the underlying network structure. In this work we investigate the relationship between centrality measures and the density of traffic for some simple particle hopping models on networks with emerging scale-free degree distributions. We also study how the speed of the dynamics are affected by the underlying network structure. Among other conclusions, we find that, even at low traffic densities, the dynamical measure of traffic density (the occupation ratio) has a non-trivial dependence on the static centrality (quantified by "betweenness centrality"), which non-central vertices getting a comparatively large portion of the traffic.

To appear in Advances in Complex Systems

References in corpus (17)

• Emergence of scaling in random networks
• Assortative mixing in networks
• Random graphs with arbitrary degree distributions and their applications
• Traffic and Related Self-Driven Many-Particle Systems
• Classes of behavior of small-world networks
• Statistical Physics of Vehicular Traffic and Some Related Systems
• Attack vulnerability of complex networks
• Growing Scale-Free Networks with Tunable Clustering
• Large-scale topological and dynamical properties of Internet
• Classification of scale-free networks
• Vertex overload breakdown in evolving networks
• Dynamic instabilities induced by asymmetric influence: Prisoners' dilemma game on small-world networks
• Edge overload breakdown in evolving networks
• Shortest paths and load scaling in scale-free trees
• Scaling of random spreading in small world networks
• Adaptive Random Walks on the Class of Web Graph
• A Microscopic Model for Packet Transport in the Internet

Cited by in corpus (24)

• Cascade control and defense in complex networks
• Social physics
• Power-law Strength-Degree Correlation From a Resource-Allocation Dynamics on Weighted Networks
• From the betweenness centrality in street networks to structural invariants in random planar graphs
• Transport on Complex Networks: Flow, Jamming and Optimization
• Congestion and decongestion in a communication network
• Complete Condensation in a Zero Range Process on Scale-Free Networks
• Congestion-gradient driven transport on complex networks
• Incremental Deployment of Network Monitors Based on Group Betweenness Centrality
• How Many Nodes are Effectively Accessed in Complex Networks?
• Fluctuation-driven capacity distribution in complex networks
• Walks on Apollonian networks
• Mittag-Leffler functions and their applications in network science
• Local Gaussian Processes for Efficient Fine-Grained Traffic Speed Prediction
• Scaling behavior of an artificial traffic model on scale-free networks
• Betweenness centrality in dense spatial networks
• Self Avoiding Paths Routing Algorithm in Scale-Free Networks
• Transmission of packets on a hierarchical network: Statistics and explosive percolation
• Complex Grid Computing
• Dynamic scaling regimes of collective decision making
• Centralities for Networks with Consumable Resources
• Internet data packet transport: from global topology to local queueing dynamics
• Network heterogeneity and node capacity lead to heterogeneous scaling of fluctuations in random walks on graphs
• Temporal-varying failures of nodes in networks