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… (More)


1 Figure or Table

Cite this paper

@article{Blin2017CompactSL, title={Compact Self-Stabilizing Leader Election for Arbitrary Networks}, author={L{\'e}lia Blin and S{\'e}bastien Tixeuil}, journal={CoRR}, year={2017}, volume={abs/1702.07605} }