Zur Kurzanzeige

dc.contributor.authorMertens, Robert
dc.contributor.authorStachowiak, Joerg
dc.contributor.authorSteffens, Timo
dc.contributor.editorHegering, Heinz-Gerd
dc.contributor.editorLehmann, Axel
dc.contributor.editorOhlbach, Hans Jürgen
dc.contributor.editorScheideler, Christian
dc.date.accessioned2019-04-03T12:59:54Z
dc.date.available2019-04-03T12:59:54Z
dc.date.issued2008
dc.identifier.isbn978-3-88579-227-7
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/21348
dc.description.abstractTransit nodes are a concept that has proven to speed up pathfinding in roadnetworks considerably. The main idea of transit nodes is to precompute paths for selected routes and use these as shortcuts during the search. While this method can be employed for road networks that remain static over a period of time, it can not be directly applied to complex fast changing networks such as those used for telecommunication since precomputed shortcuts can become invalid at any time. In this paper, an approach is presented that is based on transit nodes but extends the concept to accommodate for the special requirements of fast changing networks.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e. V.
dc.relation.ispartofINFORMATIK 2008. Beherrschbare Systeme – dank Informatik. Band 1
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-133
dc.titlePath Searching with Transit Nodes in Fast Changing Telecommunications Networksen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages158-163
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationMünchen
mci.conference.date8. -13. September 2008


Dateien zu dieser Ressource

Thumbnail

Zur Kurzanzeige