A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Compact Deterministic Self-Stabilizing Leader Election: The Exponential Advantage of Being Talkative
[article]
2014
arXiv
pre-print
This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem. When the protocol is required to be silent (i.e., when communication content remains fixed from some point in time during any execution), there exists a lower bound of Omega( n) bits of memory per node participating to the leader election (where n denotes the number of nodes in the system). This lower bound holds even in rings. We present a new deterministic (non-silent) self-stabilizing
arXiv:1401.4972v1
fatcat:mrshf6hn3rfttmvuy2xrxl6xmm