Document Open Access Logo

Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols

Authors Haruki Kanaya , Ryota Eguchi , Taisho Sasada , Michiko Inoue

PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2024.37.pdf
  • Filesize: 0.88 MB
  • 17 pages

Document Identifiers

Author Details

Haruki Kanaya
  • Nara Institute of Science and Technology, Japan
Ryota Eguchi
  • Nara Institute of Science and Technology, Japan
Taisho Sasada
  • Nara Institute of Science and Technology, Japan
Michiko Inoue
  • Nara Institute of Science and Technology, Japan

Funding

The second author was supported by JSPS KAKENHI Grant Number 22H03569.

Cite As Get BibTex

Haruki Kanaya, Ryota Eguchi, Taisho Sasada, and Michiko Inoue. Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols. In 28th International Conference on Principles of Distributed Systems (OPODIS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 324, pp. 37:1-37:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.OPODIS.2024.37

Abstract

The population protocol model is a computational model for passive mobile agents. We address the leader election problem, which determines a unique leader on arbitrary communication graphs starting from any configuration. Unfortunately, self-stabilizing leader election is impossible to be solved without knowing the exact number of agents; thus, we consider loosely-stabilizing leader election, which converges to safe configurations in a relatively short time, and holds the specification (maintains a unique leader) for a relatively long time. When agents have unique identifiers, Sudo {et al. }(2019) proposed a protocol that, given an upper bound N for the number of agents n, converges in O(mNlog n) expected steps, where m is the number of edges. When unique identifiers are not required, they also proposed a protocol that, using random numbers and given N, converges in O(mN²log{N}) expected steps. Both protocols have a holding time of Ω(e^{2N}) expected steps and use O(log{N}) bits of memory. They also showed that the lower bound of the convergence time is Ω(mN) expected steps for protocols with a holding time of Ω(e^N) expected steps given N.
In this paper, we propose protocols that do not require unique identifiers. These protocols achieve convergence times close to the lower bound with increasing memory usage. Specifically, given N and an upper bound Δ for the maximum degree, we propose two protocols whose convergence times are O(mNlog n) and O(mNlog N) both in expectation and with high probability. The former protocol uses random numbers, while the latter does not require them. Both protocols utilize O(Δ log N) bits of memory and hold the specification for Ω(e^{2N}) expected steps.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • Population protocols
  • Leader election
  • Loose-stabilization
  • Self-stabilization

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Dan Alistarh, Rati Gelashvili, and Joel Rybicki. Fast Graphical Population Protocols. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021), volume 217, pages 14:1-14:18, 2022. URL: https://doi.org/10.4230/LIPICS.OPODIS.2021.14.
  2. Dan Alistarh, Joel Rybicki, and Sasha Voitovych. Near-optimal leader election in population protocols on graphs. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, pages 246-256, 2022. URL: https://doi.org/10.1145/3519270.3538435.
  3. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, and René Peralta. Computation in networks of passively mobile finite-state sensors. Distributed Computing, 18(4):235-253, 2006. URL: https://doi.org/10.1007/S00446-005-0138-3.
  4. Dana Angluin, James Aspnes, Michael J. Fischer, and Hong Jiang. Self-stabilizing population protocols. ACM Trans. Auton. Adapt. Syst., 3(4), 2008. URL: https://doi.org/10.1145/1452001.1452003.
  5. Joffroy Beauquier, Peva Blanchard, and Janna Burman. Self-stabilizing leader election in population protocols over arbitrary communication graphs. In Principles of Distributed Systems, pages 38-52, 2013. URL: https://doi.org/10.1007/978-3-319-03850-6_4.
  6. Petra Berenbrink, George Giakkoupis, and Peter Kling. Optimal time and space leader election in population protocols. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pages 119-129, 2020. URL: https://doi.org/10.1145/3357713.3384312.
  7. Janna Burman, Ho-Lin Chen, Hsueh-Ping Chen, David Doty, Thomas Nowak, Eric Severson, and Chuan Xu. Time-optimal self-stabilizing leader election in population protocols. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pages 33-44, 2021. URL: https://doi.org/10.1145/3465084.3467898.
  8. Shukai Cai, Taisuke Izumi, and Koichi Wada. How to prove impossibility under global fairness: On space complexity of self-stabilizing leader election on a population protocol model. Theory of Computing Systems, 50(3):433-445, 2012. URL: https://doi.org/10.1007/S00224-011-9313-Z.
  9. Davide Canepa and Maria Gradinariu Potop-Butucaru. Stabilizing leader election in population protocols. Research Report RR-6269, INRIA, 2007. Google Scholar
  10. Michael Fischer and Hong Jiang. Self-stabilizing leader election in networks of finite-state anonymous agents. In Principles of Distributed Systems, pages 395-409, 2006. URL: https://doi.org/10.1007/11945529_28.
  11. Leszek Gąsieniec, Grzegorz Stachowiak, and Przemyslaw Uznanski. Almost logarithmic-time space optimal leader election in population protocols. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures, pages 93-102, 2019. URL: https://doi.org/10.1145/3323165.3323178.
  12. Taisuke Izumi. On space and time complexity of loosely-stabilizing leader election. In Structural Information and Communication Complexity, pages 299-312, 2015. URL: https://doi.org/10.1007/978-3-319-25258-2_21.
  13. Svante Janson. Tail bounds for sums of geometric and exponential variables. Statistics & Probability Letters, 135:1-6, 2018. Google Scholar
  14. Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005. URL: https://doi.org/10.1017/CBO9780511813603.
  15. Yuichi Sudo, Ryota Eguchi, Taisuke Izumi, and Toshimitsu Masuzawa. Time-Optimal Loosely-Stabilizing Leader Election in Population Protocols. In 35th International Symposium on Distributed Computing (DISC 2021), volume 209, pages 40:1-40:17, 2021. URL: https://doi.org/10.4230/LIPICS.DISC.2021.40.
  16. Yuichi Sudo, Junya Nakamura, Yukiko Yamauchi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa. Loosely-stabilizing leader election in a population protocol model. Theoretical Computer Science, 444:100-112, 2012. URL: https://doi.org/10.1016/J.TCS.2012.01.007.
  17. Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, and Toshimitsu Masuzawa. Time-optimal leader election in population protocols. IEEE Transactions on Parallel and Distributed Systems, 31(11):2620-2632, 2020. URL: https://doi.org/10.1109/TPDS.2020.2991771.
  18. Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa. Loosely-stabilizing leader election on arbitrary graphs in population protocols. In Principles of Distributed Systems, pages 339-354, 2014. URL: https://doi.org/10.1007/978-3-319-14472-6_23.
  19. Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa. Loosely stabilizing leader election on arbitrary graphs in population protocols without identifiers or random numbers. IEICE Transactions on Information and Systems, E103.D(3):489-499, 2020. URL: https://doi.org/10.1587/TRANSINF.2019FCP0003.
  20. Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, and Lawrence L. Larmore. Loosely-stabilizing leader election for arbitrary graphs in population protocol model. IEEE Transactions on Parallel and Distributed Systems, 30(6), 2019. URL: https://doi.org/10.1109/TPDS.2018.2881125.
  21. Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, and Lawrence L. Larmore. Loosely-stabilizing leader election with polylogarithmic convergence time. Theoretical Computer Science, 806:617-631, 2020. URL: https://doi.org/10.1016/J.TCS.2019.09.034.
  22. Yuichi Sudo, Masahiro Shibata, Junya Nakamura, Yonghwan Kim, and Toshimitsu Masuzawa. Self-stabilizing population protocols with global knowledge. IEEE Transactions on Parallel and Distributed Systems, 32(12):3011-3023, 2021. URL: https://doi.org/10.1109/TPDS.2021.3076769.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact