Self-Stabilizing Leader Election in Optimal Space
نویسندگان
چکیده
A silent self-stabilizing asynchronous distributed algorithm, SSLE, for the leader election problem, in a connected unoriented network with unique IDs, is given. SSLE uses O(log n) space per process and stabilizes in O(n) rounds, where n is the number of processes in the network.
منابع مشابه
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space complexity is optimal to within a small additive constant number of bits per processor, significantly improving previous self-stabilizing algorithms for this problem. In other models or when the ring size is composite,...
متن کاملDeterministic silence and self stabilizing leader election algorithm on id based ring
We present in this paper a deterministic silence and self stabilizing leader election algorithm on unidirectional id based rings which have a bound on their id values The id values of proces sors in a ring whose size is N have to be inferior to N k The size of communication registers required by the algorithm is constant The algorithm stabilizes in k N time keywords self stabilization leader el...
متن کاملStabilizing token schemes for population protocols
In this paper we address the stabilizing token circulation and leader election problems in population protocols model augmented with oracles. Population protocols is a recent model of computation that captures the interactions of biological systems. In this model emergent global behavior is observed while anonymous finite-state agents(nodes) perform local peer interactions. Uniform self-stabili...
متن کاملDeterministic silence and self stabilizing leader election algorithm on id based rings
We present in this paper a deterministic silence and self stabilizing leader election algorithm on unidirectional id based rings which have bound on their id values The id values of processors in a ring whose size is N have to be inferior to N k The size of commu nication registers required by the algorithm is constant The algorithm stabilizes in k N time In DGS Dolev Gouda and Schneider have e...
متن کاملCompact Self-Stabilizing Leader Election for Arbitrary Networks
We present a self-stabilizing leader election algorithm for arbitrary networks, with spacecomplexity Opmaxtlog∆, log lognuq bits per node in n-node networks with maximum degree ∆. This space complexity is sub-logarithmic in n as long as ∆ “ n. The best space-complexity known so far for arbitrary networks was Oplog nq bits per node, and algorithms with sublogarithmic space-complexities were know...
متن کامل