Bachelor Thesis BCLR-0020

BibliographySchnelle, Niklas: Distributed Shortest-Path Computation.
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Bachelor Thesis No. 20 (2013).
35 pages, english.
CR-SchemaG.2.2 (Discrete Mathematics Graph Theory)
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.

Full text and
other links
PDF (2210429 Bytes)
Department(s)University of Stuttgart, Institute of Formal Methods in Computer Science, Algorithmic
Superviser(s)Funke, Stefan
Entry dateMarch 14, 2013
   Publ. Computer Science