Theoretical approach and impact of correlations on the critical packet generation rate in traffic dynamics on complex networks

Abstract

Using the formalism of the biased random walk in random uncorrelated networks with arbitrary degree distributions, we develop theoretical approach to the critical packet generation rate in traffic based on routing strategy with local information. We explain microscopic origins of the transition from the flow to the jammed phase and discuss how the node neighbourhood topology affects the transport capacity in uncorrelated and correlated networks.

6 pages, 5 figures

References in corpus (8)

• Integrating static and dynamic information for routing traffic
• Biased random walks on complex networks: the role of local navigation rules
• Congestion phenomena on complex networks
• Traffic optimization in transport networks based on local routing
• Percolation transition in networks with degree-degree correlation
• Urban traffic from the perspective of dual graph
• Phase transitions in social networks
• Random Walks on Complex Networks

Cited by in corpus (2)

• Characteristic times of biased random walks on complex networks
• Effect of correlation on the traffic capacity of Time Varying Communication Network