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.
A self-stabilizing algorithm to synchronize digital clocks in a distributed system
โ Scribed by Srinivasan Chandrasekar; Pradip K. Srimani
- Book ID
- 113212060
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 383 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0045-7906
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We propose a self-stabilizing algorithm (protocol) for computing the median in a given tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.
Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a self-stabilizing distributed algorithm for the MST problem and to prove i
Spanning trees help removing cycles and establishing short paths between a given node and the rest of the nodes in a network. In ad hoc mobile computing networks, however, transient node failures occur due to being out of range or powered off. Therefore, we present a self-stabilized distributed algo