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

A self-stabilizing enumeration algorithm

โœ Scribed by Emmanuel Godard

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
99 KB
Volume
82
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper describes a self-stabilizing version of an algorithm presented by A. Mazurkiewicz [Inform. Process. Lett. 61 (1997) 233-239] for enumerating nodes by local rules on an anonymous network. The result improves the reliability aspects of the original algorithm and underlines the importance of a non-ambiguous topology for a network.

๐Ÿ“œ SIMILAR VOLUMES

A Quorum-Based Self-Stabilizing Distribu
A Quorum-Based Self-Stabilizing Distributed Mutual Exclusion Algorithm
โœ Mikhail Nesterenko; Masaaki Mizuno ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 187 KB

In this paper, we present a self-stabilizing quorum-based distributed mutual exclusion algorithm. Our algorithm is designed for an asynchronous message-passing model. The algorithm scales well since it has constant synchronization delay and its message complexity is proportional to the square root o