Bachelorarbeit BCLR-0020

Schnelle, Niklas: Distributed Shortest-Path Computation.
Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, Bachelorarbeit Nr. 20 (2013).
35 Seiten, englisch.
CR-Klassif.G.2.2 (Discrete Mathematics Graph Theory)

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.

Volltext und
andere Links
PDF (2210429 Bytes)
Abteilung(en)Universität Stuttgart, Institut für Formale Methoden der Informatik, Algorithmik
BetreuerFunke, Stefan
Eingabedatum14. März 2013
   Publ. Informatik