ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2305.08375
31
5

A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States

15 May 2023
D. Yokota
Y. Sudo
Fukuhito Ooshita
Toshimitsu Masuzawa
ArXiv (abs)PDFHTML
Abstract

We propose a self-stabilizing leader election (SS-LE) protocol on ring networks in the population protocol model. Given a rough knowledge ψ=⌈log⁡n⌉+O(1)\psi = \lceil \log n \rceil + O(1)ψ=⌈logn⌉+O(1) on the population size nnn, the proposed protocol lets the population reach a safe configuration within O(n2log⁡n)O(n^2 \log n)O(n2logn) steps with high probability starting from any configuration. Thereafter, the population keeps the unique leader forever. Since no protocol solves SS-LE in o(n2)o(n^2)o(n2) steps with high probability, the convergence time is near-optimal: the gap is only an O(log⁡n)O(\log n)O(logn) multiplicative factor. This protocol uses only polylog(n)polylog(n)polylog(n) states. There exist two state-of-the-art algorithms in current literature that solve SS-LE on ring networks. The first algorithm uses a polynomial number of states and solves SS-LE in O(n2)O(n^2)O(n2) steps, whereas the second algorithm requires exponential time but it uses only a constant number of states. Our proposed algorithm provides an excellent middle ground between these two.

View on arXiv
Comments on this paper