Anonymous daemon conversion in self-stabilizing algorithms by randomization in constant space

Authors:
W. Goddard;S. T. Hedetniemi;D. P. Jacobs;Pradip K. Srimani
Affiliations:
School of Computing, Clemson University, Clemson, SC;School of Computing, Clemson University, Clemson, SC;School of Computing, Clemson University, Clemson, SC;School of Computing, Clemson University, Clemson, SC
Venue:
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Year:
2008

Citing 9
Cited 2

Time optimal self-stabilizing synchronization

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Uniform self-stabilizing ring orientation

Information and Computation
Self-stabilization

Self-stabilization
Self-Stabilizing Strong Fairness under Weak Fairness

IEEE Transactions on Parallel and Distributed Systems
Stabilization-preserving atomicity refinement

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Uniform Deterministic Self-Stabilizing Ring-Orientation on Odd-Length Rings

WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments

WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
The alternator

ICDCS '99 Workshop on Self-stabilizing Systems

Fault tolerance in wireless sensor networks through self-stabilisation

International Journal of Communication Networks and Distributed Systems
Self-stabilizing algorithm for maximal graph partitioning into triangles

SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a generalized scheme that can convert any algorithm that self-stabilizes under an unfair central daemon into a randomized one that self-stabilizes under a distributed daemon, using only constant extra space and without IDs. If the original algorithm is anonymous the resulting self-stabilizing algorithm is also anonymous. We provide a detailed complexity analysis that show that the expected slowdown is upper bounded by O(n3).