Path Searching with Transit Nodes in Fast Changing Telecommunications Networks
dc.contributor.author | Mertens, Robert | |
dc.contributor.author | Stachowiak, Joerg | |
dc.contributor.author | Steffens, Timo | |
dc.contributor.editor | Hegering, Heinz-Gerd | |
dc.contributor.editor | Lehmann, Axel | |
dc.contributor.editor | Ohlbach, Hans Jürgen | |
dc.contributor.editor | Scheideler, Christian | |
dc.date.accessioned | 2019-04-03T12:59:54Z | |
dc.date.available | 2019-04-03T12:59:54Z | |
dc.date.issued | 2008 | |
dc.description.abstract | Transit 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.identifier.isbn | 978-3-88579-227-7 | |
dc.identifier.pissn | 1617-5468 | |
dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/21348 | |
dc.language.iso | en | |
dc.publisher | Gesellschaft für Informatik e. V. | |
dc.relation.ispartof | INFORMATIK 2008. Beherrschbare Systeme – dank Informatik. Band 1 | |
dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-133 | |
dc.title | Path Searching with Transit Nodes in Fast Changing Telecommunications Networks | en |
dc.type | Text/Conference Paper | |
gi.citation.endPage | 163 | |
gi.citation.publisherPlace | Bonn | |
gi.citation.startPage | 158 | |
gi.conference.date | 8. -13. September 2008 | |
gi.conference.location | München | |
gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1