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

Xiaoguang Xu, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

8 引用 (Scopus)

抜粋

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.

元の言語英語
ホスト出版物のタイトルStabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings
ページ86-97
ページ数12
DOI
出版物ステータス出版済み - 12 1 2013
イベント15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013 - Osaka, 日本
継続期間: 11 13 201311 16 2013

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
8255 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013
日本
Osaka
期間11/13/1311/16/13

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント Space complexity of self-stabilizing leader election in population protocol based on k-interaction' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Xu, X., Yamauchi, Y., Kijima, S., & Yamashita, M. (2013). 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 (pp. 86-97). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8255 LNCS). https://doi.org/10.1007/978-3-319-03089-0_7