OA-Netzwerk Logo

Title:
  • Distributed shortest-path computation
Authors:
  • Niklas Schnelle
Publisher/Institution:
  • Universität Stuttgart
  • Fakultät Informatik, Elektrotechnik und Informationstechnik. Institut für formale Methoden der Informatik
Abstract:
We are proposing a technique to distribute the computational load of online route planners like Google/Bing/Nokia Maps between backend servers and clients. We are presenting an implementation integrated in the ToureNPlaner online routing service and its Android client that increases throughput by more than a factor of 8. Based on Contraction Hierarchies we are decreasing the amount of per request computation on backend systems enabling a leaner and less energy hungry infrastructure to be used that scales with IO instead of CPU power.
Classification:
  • DDC: Informatik (004)
  • DDC: Allgemeines, Wissenschaft (000)
  • DINI: doc-type:bachelorThesis
Date:
  • Dec 31, 2011
Format:
  • application/pdf
Document Type:
Language:
  • Englisch (eng)
Identifier:
  • urn:nbn:de:bsz:93-opus-82979
  • http://elib.uni-stuttgart.de/opus/volltexte/2013/8297/
fulltext:
Origin:
Similarities:
OAIPMH-Record:
Keywords
Hypergraphs (NEW)GoogleWikipedia
Graph algorithmsGoogleWikipedia
Network problemsGoogleWikipedia
Data processingGoogleWikipedia
Computer scienceGoogleWikipedia
Path and circuit problemsGoogleWikipedia
TreesGoogleWikipedia
Graph labeling (NEW)GoogleWikipedia