Gesellschaft fr Informatik e.V.

Lecture Notes in Informatics


INFORMATIK 2008 Beherrschbare Systeme -dank Informatik Band 1 P-133, 158-163 (2008).

Gesellschaft für Informatik, Bonn
2008


Editors

Heinz-Gerd Hegering, Axel Lehmann, Hans Jürgen Ohlbach, Christian Scheideler (eds.)


Copyright © Gesellschaft für Informatik, Bonn

Contents

Path Searching with Transit Nodes in Fast Changing Telecommunications Networks

Robert Mertens , Timo Steffens and Joerg Stachowiak

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.


Full Text: PDF

Gesellschaft für Informatik, Bonn
ISBN 978-3-88579-227-7


Last changed 24.01.2012 22:01:54