Loosely-stabilizing leader election in population protocol model

Yuichi Sudo, Junya Nakamura, Yukiko Yamauchi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

A self-stabilizing protocol guarantees that starting from an arbitrary initial configuration, a system eventually comes to satisfy its specification and keeps the specification forever. Although self-stabilizing protocols show excellent fault-tolerance against any transient faults (e.g. memory crash), designing self-stabilizing protocols is difficult and, what is worse, might be impossible due to the severe requirements. To circumvent the difficulty and impossibility, we introduce a novel notion of loose-stabilization, that relaxes the closure requirement of self-stabilization; starting from an arbitrary configuration, a system comes to satisfy its specification in a relatively short time, and it keeps the specification for a long time, though not forever. To show effectiveness and feasibility of this new concept, we present a probabilistic loosely-stabilizing leader election protocol in the Probabilistic Population Protocol (PPP) model of complete networks. Starting from any configuration, the protocol elects a unique leader within O(nN log n) expected steps and keeps the unique leader for Ω(NeN) expected steps, where n is the network size (not known to the protocol) and N is a known upper bound of n. This result proves that introduction of the loose-stabilization circumvents the already-known impossibility result; the self-stabilizing leader election problem in the PPP model of complete networks cannot be solved without the knowledge of the exact network size.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity - 16th International Colloquium, SIROCCO 2009, Revised Selected Papers
Pages295-308
Number of pages14
Volume5869 LNCS
DOIs
Publication statusPublished - Mar 22 2010
Externally publishedYes
Event16th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2009 - Piran, Slovenia
Duration: May 25 2009May 27 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5869 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other16th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2009
CountrySlovenia
CityPiran
Period5/25/095/27/09

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Loosely-stabilizing leader election in population protocol model'. Together they form a unique fingerprint.

  • Cite this

    Sudo, Y., Nakamura, J., Yamauchi, Y., Ooshita, F., Kakugawa, H., & Masuzawa, T. (2010). Loosely-stabilizing leader election in population protocol model. In Structural Information and Communication Complexity - 16th International Colloquium, SIROCCO 2009, Revised Selected Papers (Vol. 5869 LNCS, pp. 295-308). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5869 LNCS). https://doi.org/10.1007/978-3-642-11476-2_23