Decentralized Routing on Spatial Networks with Stochastic Edge Weights

  title={Decentralized Routing on Spatial Networks with Stochastic Edge Weights},
  author={Till Hoffmann and Renaud Lambiotte and Mason A. Porter},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={88 2},
We investigate algorithms to find short paths in spatial networks with stochastic edge weights. Our formulation of the problem of finding short paths differs from traditional formulations because we specifically do not make two of the usual simplifying assumptions: (1) we allow edge weights to be stochastic rather than deterministic and (2) we do not assume that global knowledge of a network is available. We develop a decentralized routing algorithm that provides en route guidance for travelers… 
2 Citations

Figures from this paper

Route Distribution Control in Road Traffic Networks to Make On-Board Navigation Systems Become Part of the Traffic Management
The paper will introduce the full chain for the centralized routing application developed within the eCoMove project for urban areas by introducing the TPEG RMR (Road and Multimodal Routes) Protocol.
Lost in transportation: Information measures and cognitive limits in multilayer navigation
Analysis of the world’s 15 largest metropolitan networks suggests that maps should not consist of more than 250 connection points to be easily readable and that including connections with other transportation modes dramatically increases the information needed to navigate in multilayer transportation networks.


Arriving on Time
This research proposes a procedure for identifying dynamic routing policies in stochastic transportation networks using the Laplace transform and its numerical inversion to reduce the computational cost of evaluating the convolution integrals that result from the successive approximation procedure.
Connected Spatial Networks over Random Points and a Route-Length Statistic
Author(s): Aldous, DJ; Shun, J | Abstract: We review mathematically tractable models for connected networks on random points in the plane, emphasizing the class of proximity graphs which deserves to
Path Preferences and Optimal Paths in Probabilistic Networks
It is shown that when the utility function is linear or exponential (constant risk averseness), permanent preferences prevail and an efficient Dijkstra-type algorithm can be used.
Greedy Connectivity of Geographically Embedded Graphs
  • Jie Sun, D. ben-Avraham
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2010
We introduce a measure of greedy connectivity for geographical networks (graphs embedded in space) and where the search for connecting paths relies only on local information, such as a node's
Arriving-on-time problem : Discrete algorithm that ensures convergence
This study proposes a discrete SOTA algorithm that runs in an optimal polynomial time and thus improves the computational efficiency significantly and also providesumerical examples, and future extensions are proposed.
Spatial Networks
  • M. Barthelemy
  • Computer Science
    Encyclopedia of Social Network Analysis and Mining
  • 2014
On compact routing for the internet
It is demonstrated that in view of recent results in compact routing research, logarithmic scaling on Internet-like topologies is fundamentally impossible in the presence of topology dynamics or topology-independent (flat) addressing, and a fundamental re-examination of assumptions behind routing models and abstractions is needed.
Geographic routing in social networks
A richer model relating geography and social-network friendship is introduced, in which the probability of befriending a particular person is inversely proportional to the number of closer people.