Loosely-stabilizing leader election in a population protocol model

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

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

A self-stabilizing protocol guarantees that starting from any 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 any arbitrary configuration, a system comes to satisfy its specification in a relatively short time, and it keeps the specification not forever but for a long time. To show the 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(nNlogn) expected steps and keeps the unique leader for Ω(N eN) 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
Pages (from-to)100-112
Number of pages13
JournalTheoretical Computer Science
Volume444
DOIs
Publication statusPublished - Jul 27 2012

Fingerprint

Leader Election
Specifications
Stabilization
Specification
Fault tolerance
Model
Configuration
Self-stabilization
Transient Faults
Data storage equipment
Requirements
Arbitrary
Crash
Fault Tolerance
Closure
Upper bound

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Loosely-stabilizing leader election in a population protocol model. / Sudo, Yuichi; Nakamura, Junya; Yamauchi, Yukiko; Ooshita, Fukuhito; Kakugawa, Hirotsugu; Masuzawa, Toshimitsu.

In: Theoretical Computer Science, Vol. 444, 27.07.2012, p. 100-112.

Research output: Contribution to journalArticle

Sudo, Yuichi ; Nakamura, Junya ; Yamauchi, Yukiko ; Ooshita, Fukuhito ; Kakugawa, Hirotsugu ; Masuzawa, Toshimitsu. / Loosely-stabilizing leader election in a population protocol model. In: Theoretical Computer Science. 2012 ; Vol. 444. pp. 100-112.
@article{5567008676df4ccd9a620ba2143bdab3,
title = "Loosely-stabilizing leader election in a population protocol model",
abstract = "A self-stabilizing protocol guarantees that starting from any 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 any arbitrary configuration, a system comes to satisfy its specification in a relatively short time, and it keeps the specification not forever but for a long time. To show the 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(nNlogn) expected steps and keeps the unique leader for Ω(N eN) 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.",
author = "Yuichi Sudo and Junya Nakamura and Yukiko Yamauchi and Fukuhito Ooshita and Hirotsugu Kakugawa and Toshimitsu Masuzawa",
year = "2012",
month = "7",
day = "27",
doi = "10.1016/j.tcs.2012.01.007",
language = "English",
volume = "444",
pages = "100--112",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Loosely-stabilizing leader election in a population protocol model

AU - Sudo, Yuichi

AU - Nakamura, Junya

AU - Yamauchi, Yukiko

AU - Ooshita, Fukuhito

AU - Kakugawa, Hirotsugu

AU - Masuzawa, Toshimitsu

PY - 2012/7/27

Y1 - 2012/7/27

N2 - A self-stabilizing protocol guarantees that starting from any 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 any arbitrary configuration, a system comes to satisfy its specification in a relatively short time, and it keeps the specification not forever but for a long time. To show the 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(nNlogn) expected steps and keeps the unique leader for Ω(N eN) 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.

AB - A self-stabilizing protocol guarantees that starting from any 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 any arbitrary configuration, a system comes to satisfy its specification in a relatively short time, and it keeps the specification not forever but for a long time. To show the 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(nNlogn) expected steps and keeps the unique leader for Ω(N eN) 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.

UR - http://www.scopus.com/inward/record.url?scp=84862026842&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84862026842&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2012.01.007

DO - 10.1016/j.tcs.2012.01.007

M3 - Article

AN - SCOPUS:84862026842

VL - 444

SP - 100

EP - 112

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -