arXiv · 1202.0213
The Competition for Shortest Paths on Sparse Graphs
Abstract
Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion. Routing becomes increasingly more difficult as the number of selected nodes increases and exhibits ergodicity breaking in the case of multiple routers. A distributed linearly-scalable routing algorithm is devised. The ground state of such systems reveals non-monotonic complex behaviors in both average path-length and algorithmic convergence, depending on the network topology, and densities of communicating nodes and routers.
Explore related subjects
Keep this discovery
Chi Ho Yeung, David Saad. 2012-02-01. The Competition for Shortest Paths on Sparse Graphs. https://doi.org/10.1103/physrevlett.108.208701
Cite the original work for its findings. Save a collection to share your selection of sources.