Distributed shortest-path computation

dc.contributor.author	Schnelle, Niklas	de
dc.date.accessioned	2013-03-26	de
dc.date.accessioned	2016-03-31T08:00:19Z
dc.date.available	2013-03-26	de
dc.date.available	2016-03-31T08:00:19Z
dc.date.issued	2012	de
dc.description.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.	en
dc.identifier.other	381193713	de
dc.identifier.uri	http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-82979	de
dc.identifier.uri	http://elib.uni-stuttgart.de/handle/11682/3056
dc.identifier.uri	http://dx.doi.org/10.18419/opus-3039
dc.language.iso	en	de
dc.rights	info:eu-repo/semantics/openAccess	de
dc.subject.ddc	004	de
dc.title	Distributed shortest-path computation	en
dc.type	bachelorThesis	de
ubs.fakultaet	Fakultät Informatik, Elektrotechnik und Informationstechnik	de
ubs.institut	Institut für Formale Methoden der Informatik	de
ubs.opusid	8297	de
ubs.publikation.typ	Abschlussarbeit (Bachelor)	de

Files

Now showing 1 - 1 of 1

Now showing 1 - 1 of 1