Service time optimal self-stabilizing token circulation protocol on anonymous undirectional rings

We present a self-stabilizing token circulation protocol on unidirectional anonymous rings. This protocol requires no processor identifiers or distinguished processor (i.e. all processors perform the same algorithm). The protocol is randomized and self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), it reaches (with probability 1) a legitimate configuration (i.e. a configuration with only one token in the network). All previous randomized self-stabilizing token circulation protocols designed to work under unfair distributed schedulers have the same drawback: once stabilized, service time is slow (in the best case, it is bounded by 2N where N is the ring size). Once stabilized, our protocol provides an optimal service: after N computation steps, each processor has obtained the token once. The protocol can be used to implement fair distributed mutual exclusion in any ring topology network.

[1]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

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

[3]  Ajoy Kumar Datta,et al.  Self-stabilizing mutual exclusion using unfair distributed scheduler , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[4]  Janos Simon,et al.  Observing self-stabilization , 1992, PODC '92.

[5]  Mohamed G. Gouda,et al.  Token Systems that Self-Stabilize , 1989, IEEE Trans. Computers.

[6]  Joffroy Beauquier,et al.  Space-Efficient, Distributed and Self-Stabilizing Depth-First Token Circulation , 1995 .

[7]  Amos Israeli,et al.  Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity , 1990, PODC.

[8]  Ajoy Kumar Datta,et al.  Self-Stabilizing Depth-First Token Passing on Rooted Networks , 1997, WDAG.

[9]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[10]  Jérôme Olivier Durand-Lose,et al.  Randomized uniform self-stabilizing mutual exclusion , 2000, Inf. Process. Lett..

[11]  Faith Ellen,et al.  A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings , 2001, DISC.

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

[13]  Sukumar Ghosh.  An alternative solution to a problem on self-stabilization , 1993, TOPL.

[14]  Franck Petit.  Highly Space-Efficient Self-Stabilizing Depth-First Token Circulation for Trees , 1997, OPODIS.

[15]  Franck Petit,et al.  Color optimal self-stabilizing depth-first token circulation , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).

[16]  Jan K. Pachl,et al.  Uniform self-stabilizing rings , 1988, TOPL.

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

[18]  Laurent Rosaz,et al.  Self-stabilizing token circulation on asynchronous uniform unidirectional rings , 2000, PODC '00.

[19]  Ajoy Kumar Datta,et al.  Self-stabilizing depth-first token circulation in arbitrary rooted networks , 2000, Distributed Computing.

[20]  H. S. M. Kruijer.  Self-Stabilization (in Spite of Distributed Control) in Tree-Structured Systems , 1979, Inf. Process. Lett..

[21]  Amos Israeli,et al.  Self-stabilization of dynamic systems assuming only read/write atomicity , 1990, PODC '90.

[22]  Mohamed G. Gouda,et al.  The Stabilizing Token Ring in Three Bits , 1996, J. Parallel Distributed Comput..

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

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

[25]  Hirotsugu Kakugawa,et al.  Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon , 2002, J. Parallel Distributed Comput..

[26]  Scott A. Smolka,et al.  Composition and Behaviors of Probabilistic I/O Automata , 1994, CONCUR.

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

[28]  Maria Gradinariu Potop-Butucaru,et al.  Token-Based Self-Stabilizing Uniform Algorithms , 2002, J. Parallel Distributed Comput..

[29]  Rafail Ostrovsky,et al.  Self-Stabilizing Symmetry Breaking in Constant Space , 2002, SIAM J. Comput..