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
.
Time-optimal Loosely-stabilizing Leader Election in Population Protocols
[article]
2020
arXiv
pre-print
We consider the leader election problem in population protocol models. In pragmatic settings of population protocols, self-stabilization is a highly desired feature owing to its fault resilience and the benefit of initialization freedom. However, the design of self-stabilizing leader election is possible only under a strong assumption (i.e. the knowledge of the exact size of a network) and rich computational resources (i.e. the number of states). Loose-stabilization, introduced by Sudo et al
arXiv:2005.09944v1
fatcat:tz4wj5mjznczrlejglu5n554me