A self-stabilizing algorithm for the shortest path problem in a distributed system
In this paper, we propose a self-stabilizing algorithm for finding shortest paths in a distributed system in which a central daemon is assumed. The correctness of the proposed algorithm is proved by using the bounded function technique. (C) 2001 Elsevier Science Ltd. All rights reserved.
self-stabilizing algorithm shortest paths central daemon bounded function distance turn nodes predecessors