The Power of Global Knowledge on Self-stabilizing Population Protocols

Sudo, Yuichi; Shibata, Masahiro; Nakamura, Junya; Kim, Yonghwan; Masuzawa, Toru

doi:10.1007/978-3-030-54921-3_14

Cited by 7 publications

(9 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In rings and regular graphs with constant degree, SSLE is feasible even with only a constant state space [10,25,26,60]. In another recent related work [57], the authors study the feasibility requirements of SSLE in arbitrary graphs, as well as the problem of ranking that we also study (see below). They show how to adapt protocols in [11,22] into protocols for an arbitrary (and unknown) connected graph topology (without any oracles, but knowing ).…”

Section: Problem Variantsmentioning

confidence: 99%

“…Recent studies relax this assumption and allow the number of states to depend on , adding computational power to the model [17,39,45], improving time complexity [2,37,51], or tolerating faults [22,39,44]. In the current work, for tolerating any number of transient faults (in the framework of self-stabilization), such relaxation is necessary [22,57] (see details below and Theorem 2.1).…”

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

Time-Optimal Self-Stabilizing Leader Election in Population Protocols

Burman

Chen

et al. 2021

Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

We consider the standard population protocol model, where (a priori) indistinguishable and anonymous agents interact in pairs according to uniformly random scheduling. The self-stabilizing leader election problem requires the protocol to converge on a single leader agent from any possible initial configuration. We initiate the study of time complexity of population protocols solving this problem in its original setting: with probability 1, in a complete communication graph. The only previously known protocol by Cai, Izumi, and Wada [Theor. Comput. Syst. 50] runs in expected parallel time Θ( 2 ) and has the optimal number of states in a population of agents. The existing protocol has the additional property that it becomes silent, i.e., the agents' states eventually stop changing.Observing that any silent protocol solving self-stabilizing leader election requires Ω( ) expected parallel time, we introduce a silent protocol that uses optimal ( ) parallel time and states. Without any silence constraints, we show that it is possible to solve self-stabilizing leader election in asymptotically optimal expected parallel time of (log ), but using at least exponential states (a quasipolynomial number of bits). All of our protocols (and also that of Cai et al.) work by solving the more difficult ranking problem: assigning agents the ranks 1, . . . , .

show abstract

Section: Problem Variantsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 98%

Time-Optimal Self-Stabilizing Leader Election in Population Protocols

Burman

Chen

et al. 2021

Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

show abstract

“…Sudo et al [10], [12] gave a self-stabilizing 2hop coloring protocol that uses a much smaller memory space of agents. Sudo et al [20] investigates the possibility of self-stabilizing protocols for leader election, ranking, degree recognition, and neighbor recognition on arbitrary graphs.…”

Section: Introductionmentioning

confidence: 99%

“…The goal of the leader election problem is electing exactly one agent as a leader in the population. Unfortunately, SS-LE is impossible to solve without an additional assumption even if we focus only on complete graphs [3], [14], [20]. The studies to overcome this impossibility in the literature are roughly classified into four categories.…”

Section: Introductionmentioning

confidence: 99%