Space complexity of self-stabilizing leader election in population protocol based on k-interaction

Xiaoguang Xu, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita

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

6 Citations (Scopus)

Abstract

Population protocol (PP) is a distributed computing model for passively mobile systems, in which a computation is executed by interactions between two agents. This paper is concerned with an extended model, population protocol based on interactions of at most k agents (PPk). Beauquier et al. (2012) recently introduced the model, and showed a hierarchy of computational powers of PPk with respect to k; a PPk+1 is strictly more powerful than a PPk. Motivated by a further understanding of the model, this paper investigates the space complexity of PPk for self-stabilizing leader election (SS-LE), which is a fundamental problem for a distributed system. Cai et al. (2012) showed that the space complexity of SS-LE for n agents by a PP (i.e., PP2) is exactly n. This paper shows that the space complexity of SS-LE for n agents by a PPk is exactly ⌈(n - 1)/(k - 1)⌉ + 1.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings
Pages86-97
Number of pages12
DOIs
Publication statusPublished - Dec 1 2013
Event15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013 - Osaka, Japan
Duration: Nov 13 2013Nov 16 2013

Publication series

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

Other

Other15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013
CountryJapan
CityOsaka
Period11/13/1311/16/13

Fingerprint

Leader Election
Space Complexity
Interaction
Mobile Systems
Distributed computer systems
Population Model
Distributed Computing
Distributed Systems
Strictly
Model

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Xu, X., Yamauchi, Y., Kijima, S., & Yamashita, M. (2013). Space complexity of self-stabilizing leader election in population protocol based on k-interaction. In Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings (pp. 86-97). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8255 LNCS). https://doi.org/10.1007/978-3-319-03089-0_7

Space complexity of self-stabilizing leader election in population protocol based on k-interaction. / Xu, Xiaoguang; Yamauchi, Yukiko; Kijima, Shuji; Yamashita, Masafumi.

Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings. 2013. p. 86-97 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8255 LNCS).

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

Xu, X, Yamauchi, Y, Kijima, S & Yamashita, M 2013, Space complexity of self-stabilizing leader election in population protocol based on k-interaction. in Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8255 LNCS, pp. 86-97, 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013, Osaka, Japan, 11/13/13. https://doi.org/10.1007/978-3-319-03089-0_7
Xu X, Yamauchi Y, Kijima S, Yamashita M. Space complexity of self-stabilizing leader election in population protocol based on k-interaction. In Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings. 2013. p. 86-97. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-03089-0_7
Xu, Xiaoguang ; Yamauchi, Yukiko ; Kijima, Shuji ; Yamashita, Masafumi. / Space complexity of self-stabilizing leader election in population protocol based on k-interaction. Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings. 2013. pp. 86-97 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ca5d84c12a784b7bb7a0550d08a1792d,
title = "Space complexity of self-stabilizing leader election in population protocol based on k-interaction",
abstract = "Population protocol (PP) is a distributed computing model for passively mobile systems, in which a computation is executed by interactions between two agents. This paper is concerned with an extended model, population protocol based on interactions of at most k agents (PPk). Beauquier et al. (2012) recently introduced the model, and showed a hierarchy of computational powers of PPk with respect to k; a PPk+1 is strictly more powerful than a PPk. Motivated by a further understanding of the model, this paper investigates the space complexity of PPk for self-stabilizing leader election (SS-LE), which is a fundamental problem for a distributed system. Cai et al. (2012) showed that the space complexity of SS-LE for n agents by a PP (i.e., PP2) is exactly n. This paper shows that the space complexity of SS-LE for n agents by a PPk is exactly ⌈(n - 1)/(k - 1)⌉ + 1.",
author = "Xiaoguang Xu and Yukiko Yamauchi and Shuji Kijima and Masafumi Yamashita",
year = "2013",
month = "12",
day = "1",
doi = "10.1007/978-3-319-03089-0_7",
language = "English",
isbn = "9783319030883",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "86--97",
booktitle = "Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings",

}

TY - GEN

T1 - Space complexity of self-stabilizing leader election in population protocol based on k-interaction

AU - Xu, Xiaoguang

AU - Yamauchi, Yukiko

AU - Kijima, Shuji

AU - Yamashita, Masafumi

PY - 2013/12/1

Y1 - 2013/12/1

N2 - Population protocol (PP) is a distributed computing model for passively mobile systems, in which a computation is executed by interactions between two agents. This paper is concerned with an extended model, population protocol based on interactions of at most k agents (PPk). Beauquier et al. (2012) recently introduced the model, and showed a hierarchy of computational powers of PPk with respect to k; a PPk+1 is strictly more powerful than a PPk. Motivated by a further understanding of the model, this paper investigates the space complexity of PPk for self-stabilizing leader election (SS-LE), which is a fundamental problem for a distributed system. Cai et al. (2012) showed that the space complexity of SS-LE for n agents by a PP (i.e., PP2) is exactly n. This paper shows that the space complexity of SS-LE for n agents by a PPk is exactly ⌈(n - 1)/(k - 1)⌉ + 1.

AB - Population protocol (PP) is a distributed computing model for passively mobile systems, in which a computation is executed by interactions between two agents. This paper is concerned with an extended model, population protocol based on interactions of at most k agents (PPk). Beauquier et al. (2012) recently introduced the model, and showed a hierarchy of computational powers of PPk with respect to k; a PPk+1 is strictly more powerful than a PPk. Motivated by a further understanding of the model, this paper investigates the space complexity of PPk for self-stabilizing leader election (SS-LE), which is a fundamental problem for a distributed system. Cai et al. (2012) showed that the space complexity of SS-LE for n agents by a PP (i.e., PP2) is exactly n. This paper shows that the space complexity of SS-LE for n agents by a PPk is exactly ⌈(n - 1)/(k - 1)⌉ + 1.

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

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

U2 - 10.1007/978-3-319-03089-0_7

DO - 10.1007/978-3-319-03089-0_7

M3 - Conference contribution

SN - 9783319030883

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 86

EP - 97

BT - Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings

ER -