๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


A self-stabilizing algorithm for the sho
โœ Tetz C. Huang; Ji-Cherng Lin ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 352 KB

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 Distributed Algorithm
โœ Gheorghe Antonoiu; Pradip K. Srimani ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 231 KB

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.

A self-stabilizing distributed algorithm
โœ G. Antonoiu; P.K. Srimani ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 640 KB

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

A self-stabilizing distributed algorithm
โœ H. Baala; O. Flauzac; J. Gaber; M. Bui; T. El-Ghazawi ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 388 KB

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