CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS
- 1 June 2003
- journal article
- Published by World Scientific Pub Co Pte Ltd in Advances in Complex Systems
- Vol. 6 (2) , 163-176
- https://doi.org/10.1142/s0219525903000803
Abstract
The central points of communication network flow have 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"), where non-central vertices get a comparatively large portion of the traffic.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Classes of small-world networksProceedings of the National Academy of Sciences, 2000
- Graph structure in the WebComputer Networks, 2000
- Statistical physics of vehicular traffic and some related systemsPhysics Reports, 2000
- Emergence of Scaling in Random NetworksScience, 1999
- On power-law relationships of the Internet topologyACM SIGCOMM Computer Communication Review, 1999
- SPATIAL AND TEMPORAL BEHAVIOR OF CONGESTION IN INTERNET TRAFFICFractals, 1999
- Centrality in valued graphs: A measure of betweenness based on network flowSocial Networks, 1991
- Centrality in social networks conceptual clarificationSocial Networks, 1978
- A Set of Measures of Centrality Based on BetweennessSociometry, 1977
- A general theory of bibliometric and other cumulative advantage processesJournal of the American Society for Information Science, 1976