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.
Submitted Version (Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have