The Competition for Shortest Paths on Sparse Graphs

@article{Yeung2012TheCF,
  title={The Competition for Shortest Paths on Sparse Graphs},
  author={Chi Ho Yeung and David Saad},
  journal={Physical review letters},
  year={2012},
  volume={108 20},
  pages={
          208701
        }
}
  • C. Yeung, D. Saad
  • Published 1 February 2012
  • Computer Science
  • Physical review letters
Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of a nonlinear overlap cost that penalizes congestion. Routing becomes more difficult as the number of selected nodes increases and exhibits ergodicity breaking in the case of multiple routers. The ground state of such systems reveals nonmonotonic complex behaviors in average path length and algorithmic convergence, depending on the network topology, and densities of communicating… 

Figures from this paper

Shortest node-disjoint paths on random graphs
TLDR
A method based on message-passing techniques to process global information and distribute paths optimally to find the shortest paths between given source/destination pairs while avoiding path overlaps at nodes is proposed.
Global benefit of randomness in individual routing on transportation networks.
TLDR
It is found that adaptive routing strategies outperform controlled strategies in the free-flow state but not in the congested state, implying that controlled strategies may increase coordination among vehicles and are beneficial for suppressing traffic congestion.
Efficient algorithm for routing optimization via statistical mechanics
  • C. Yeung
  • Computer Science
    2013 IEEE International Conference on Communications Workshops (ICC)
  • 2013
TLDR
A distributive message-passing algorithm capable of optimizing the path configuration in real instances is devised, based on the analytical derivation, and is greatly simplified by expanding the cost function around the optimized flow.
M ay 2 01 4 Shortest node-disjoint paths on random graphs
TLDR
A method based on message-passing technology to process global information and distribute paths optimally to find the shortest paths between given source/destinatio n pairs while avoiding path overlaps at nodes is proposed.
Scalable Node-Disjoint and Edge-Disjoint Multi-wavelength Routing
TLDR
The scalable principled method developed is exact on trees but provides good approximate solutions on locally treelike graphs and provides the tool for settling an open and much-debated question on the merit of wavelength-switching nodes and the added capabilities they provide.
Self-organization scheme for balanced routing in large-scale multi-hop networks
TLDR
This work applies belief propagation (its min-sum version) to solve the network optimization problem and obtains a distributed algorithm whereby the nodes collectively discover globally optimal routes by performing low-complexity computations and exchanging messages with their neighbours.
The Edge-Disjoint Path Problem on Random Graphs by Message-Passing
TLDR
A message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations is presented, able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths.
Routing optimization in networks based on traffic gravitational field model
TLDR
This study introduces the concept of path confidence degree to evaluate the unblocked reliability of paths that it takes the traffic state of all nodes on the path into account from the overall and proposes an improved gravitational field routing protocol considering all the nodes’ gravities on thePath confidence degree.
From the physics of interacting polymers to optimizing routes on the London Underground
TLDR
This work uses the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derives a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously.
...
1
2
3
...

References

SHOWING 1-10 OF 55 REFERENCES
Optimal routing on complex networks
TLDR
This work presents a heuristic algorithm that balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to node congestion.
Search in Power-Law Networks
TLDR
A number of local search strategies that utilize high degree nodes in power-law graphs and that have costs scaling sublinearly with the size of the graph are introduced and demonstrated on the GNUTELLA peer-to-peer network.
Traffic dynamics based on local routing protocol on a scale-free network.
TLDR
This work investigates the number of packets of each node depending on its degree in the free flow state and observes the power law behavior to indicate that some fundamental relationships exist between the dynamics of synchronization and traffic on the scale-free networks.
Path finding strategies in scale-free networks.
TLDR
Numerically investigate the scale-free network model of Barabási and Albert through the use of various path finding strategies and a simple strategy, which utilizes only local information on the connectivity, is suggested and shown to yield small-world behavior.
Minimum spanning trees on random networks.
TLDR
The relationship to invasion percolation, to the directed polymer in a random media, to uniform spanning trees, and also the implications for the broader issue of universality in disordered systems are discussed.
How bad is selfish routing?
TLDR
The degradation in network performance due to unregulated traffic is quantified and it is proved that if the latency of each edge is a linear function of its congestion, then the total latency of the routes chosen by selfish network users is at most 4/3 times the minimum possible total latency.
Statistical mechanics of steiner trees.
TLDR
A general technique to translate the imposed global connectivity constrain into many local ones that can be analyzed with cavity equation techniques leads to a new optimization algorithm for MST and allows to analyze the statistical mechanics properties of MST on random graphs of various types.
Stability of shortest paths in complex networks with random edge weights.
  • J. Noh, H. Rieger
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
TLDR
It is found that the spanning tree is unstable to the introduction of disorder and displays a phase-transitionlike behavior at zero disorder strength epsilon =0, and the transport pattern is practically most stable in the SF network.
Transport in weighted networks: partition into superhighways and roads.
TLDR
It is found that one can improve significantly the global transport by improving a tiny fraction of the network, the superhighways, by ensuring the distribution of the centrality for the infinite incipient percolation cluster satisfies a power law.
Equilibration through local information exchange in networks.
  • K. Y. Wong, D. Saad
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
TLDR
An efficient distributed algorithm is devised, with simulations showing full agreement with theory, and scaling properties with the network connectivity and the resource availability are found.
...
1
2
3
4
5
...