arXiv Open Access 2019

Leader Election Requires Logarithmic Time in Population Protocols

Yuichi Sudo Toshimitsu Masuzawa

Lihat Sumber

Abstrak

This paper shows that every leader election protocol requires logarithmic stabilization time both in expectation and with high probability in the population protocol model. This lower bound holds even if each agent has knowledge of the exact size of a population and is allowed to use an arbitrarily large number of agent states. This lower bound concludes that the protocol given in [Sudo et al., SSS 2019] is time-optimal in expectation.

Topik & Kata Kunci

cs.DC

Penulis (2)

Yuichi Sudo

Toshimitsu Masuzawa

Format Sitasi

APA MLA BibTeX

Sudo, Y., Masuzawa, T. (2019). Leader Election Requires Logarithmic Time in Population Protocols. https://arxiv.org/abs/1906.11121

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2019
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓