Memory space requirements for self-stabilizing leader election protocols

We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We consider two classes of protocols: deterministic ones and randomized ones. We prove that a non-constant lower bound on the memory space is required by a SSLE protocol on unidirectional, anonymous rings (even if the protocol is randomized). We show that, if there is a deterministic protocol solving a problem on id-based systems where the processor memory space is constant and the id-values are not bounded then there is a deterministic protocol on anonymous systems using constant memory space that solves the same problem. Thus impossibility results on anonymous rings (i.e. one may design a deterministic SSLE protocol, only on prime size rings, under a centralized daemon) can be extended to those kinds of id-based rings. Nevertheless, it is possible to design a silent and deterministic SSLE protocol requiring constant memory space on unidirectional, id-based rings where the id-values are bounded. We present such a protocol. We also present a randomized SSLE protocol and a token circulation protocol under an unfair, distributed daemon on anonymous and unidirectional rings of any size. We give a lower bound on memory space requirement proving that these protocols are space optimal. The memory space required is constant on average. Keyword: self-stabilization, leader election, mutual exclusion, decidability, memory space requirement.

[1]  Roberto Segala,et al.  Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study , 2000, Distributed Computing.

[2]  Janos Simon,et al.  Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings , 1995, WDAG.

[3]  Anish Arora,et al.  Distributed Reset , 1994, IEEE Trans. Computers.

[4]  Amos Israeli,et al.  Token management schemes and random walks yield self-stabilizing mutual exclusion , 1990, PODC '90.

[5]  Hirotsugu Kakugawa,et al.  Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon , 1997, IEEE Trans. Parallel Distributed Syst..

[6]  Joffroy Beauquier.  Proving SelfStabilizing Randomized Protocols , 1997, OPODIS.

[7]  Shlomi Dolev.  Optimal Time Self Stabilization in Dynamic Systems (Preliminary Version) , 1993, WDAG.

[8]  Jan K. Pachl,et al.  Uniform Self-Stabilizing Rings , 1988, AWOC.

[9]  Edsger W. Dijkstra,et al.  Self stabilization in spite of distributed control , 1974 .

[10]  Moti Yung,et al.  Memory-Efficient Self Stabilizing Protocols for General Networks , 1990, WDAG.

[11]  Rafail Ostrovsky,et al.  Self-stabilizing symmetry breaking in constant-space (extended abstract) , 1992, STOC '92.

[12]  Rafail Ostrovsky,et al.  Self-stabilizing algorithms for synchronous unidirectional rings , 1996, SODA '96.

[13]  Ted Herman,et al.  Probabilistic Self-Stabilization , 1990, Information Processing Letters.

[14]  Shay Kutten,et al.  Time Optimal Self-Stabilizing Spanning Tree Algorithms , 1993, FSTTCS.

[15]  Nancy A. Lynch,et al.  Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study , 1997, Distributed Computing.

[16]  Shlomi Dolev,et al.  Memory requirements for silent stabilization , 1999, Acta Informatica.

[17]  Leonid A. Levin,et al.  Fast and lean self-stabilizing asynchronous protocols , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[18]  Rafail Ostrovsky,et al.  Memory-efficient and self-stabilizing network RESET (extended abstract) , 1994, PODC '94.

[19]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[20]  W DijkstraEdsger.  Self-stabilizing systems in spite of distributed control , 1974 .