Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol

Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita

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

2 Citations (Scopus)

Abstract

This paper investigates the space complexity of a self stabilizing leader election in a mediated population protocol (SS-LE MPP). Cai, Izumi and Wada (2009) showed that SS-LE in a population protocol (SS-LE PP) for n agents requires at least n agent-states, and gave a SS-LE PP with n agent-states for n agents. MPP is a model of distributed computation, introduced by Chatzigiannakis, Michail and Spirakis (2009) as an extension of PP allowing an extra memory on every agents pair. While they showed that MPP is stronger than PP in general, it was not known if a MPP can really reduce the space complexity of SS-LE with respect to agent-states. We in this paper give a SS-LE MPP with (2/3)n agent-states and a single bit memory on every agents pair for n agents. We also show that there is no SS-LE MPP with any constant agent-states and any constant size memory on each agents-pair for general n agents.

Original languageEnglish
Title of host publicationPrinciples of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings
Pages491-503
Number of pages13
DOIs
Publication statusPublished - Dec 1 2010
Event14th International Conference on Principles of Distributed Systems, OPODIS 2010 - Tozeur, Tunisia
Duration: Dec 14 2010Dec 17 2010

Publication series

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

Other

Other14th International Conference on Principles of Distributed Systems, OPODIS 2010
CountryTunisia
CityTozeur
Period12/14/1012/17/10

Fingerprint

Leader Election
Space Complexity
Upper and Lower Bounds
Data storage equipment
Distributed Computation

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Mizoguchi, R., Ono, H., Kijima, S., & Yamashita, M. (2010). Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol. In Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings (pp. 491-503). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6490 LNCS). https://doi.org/10.1007/978-3-642-17653-1_35

Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol. / Mizoguchi, Ryu; Ono, Hirotaka; Kijima, Shuji; Yamashita, Masafumi.

Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings. 2010. p. 491-503 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6490 LNCS).

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

Mizoguchi, R, Ono, H, Kijima, S & Yamashita, M 2010, Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol. in Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6490 LNCS, pp. 491-503, 14th International Conference on Principles of Distributed Systems, OPODIS 2010, Tozeur, Tunisia, 12/14/10. https://doi.org/10.1007/978-3-642-17653-1_35
Mizoguchi R, Ono H, Kijima S, Yamashita M. Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol. In Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings. 2010. p. 491-503. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-17653-1_35
Mizoguchi, Ryu ; Ono, Hirotaka ; Kijima, Shuji ; Yamashita, Masafumi. / Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol. Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings. 2010. pp. 491-503 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{e661933054204007a432184d4de314a5,
title = "Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol",
abstract = "This paper investigates the space complexity of a self stabilizing leader election in a mediated population protocol (SS-LE MPP). Cai, Izumi and Wada (2009) showed that SS-LE in a population protocol (SS-LE PP) for n agents requires at least n agent-states, and gave a SS-LE PP with n agent-states for n agents. MPP is a model of distributed computation, introduced by Chatzigiannakis, Michail and Spirakis (2009) as an extension of PP allowing an extra memory on every agents pair. While they showed that MPP is stronger than PP in general, it was not known if a MPP can really reduce the space complexity of SS-LE with respect to agent-states. We in this paper give a SS-LE MPP with (2/3)n agent-states and a single bit memory on every agents pair for n agents. We also show that there is no SS-LE MPP with any constant agent-states and any constant size memory on each agents-pair for general n agents.",
author = "Ryu Mizoguchi and Hirotaka Ono and Shuji Kijima and Masafumi Yamashita",
year = "2010",
month = "12",
day = "1",
doi = "10.1007/978-3-642-17653-1_35",
language = "English",
isbn = "3642176526",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "491--503",
booktitle = "Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings",

}

TY - GEN

T1 - Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol

AU - Mizoguchi, Ryu

AU - Ono, Hirotaka

AU - Kijima, Shuji

AU - Yamashita, Masafumi

PY - 2010/12/1

Y1 - 2010/12/1

N2 - This paper investigates the space complexity of a self stabilizing leader election in a mediated population protocol (SS-LE MPP). Cai, Izumi and Wada (2009) showed that SS-LE in a population protocol (SS-LE PP) for n agents requires at least n agent-states, and gave a SS-LE PP with n agent-states for n agents. MPP is a model of distributed computation, introduced by Chatzigiannakis, Michail and Spirakis (2009) as an extension of PP allowing an extra memory on every agents pair. While they showed that MPP is stronger than PP in general, it was not known if a MPP can really reduce the space complexity of SS-LE with respect to agent-states. We in this paper give a SS-LE MPP with (2/3)n agent-states and a single bit memory on every agents pair for n agents. We also show that there is no SS-LE MPP with any constant agent-states and any constant size memory on each agents-pair for general n agents.

AB - This paper investigates the space complexity of a self stabilizing leader election in a mediated population protocol (SS-LE MPP). Cai, Izumi and Wada (2009) showed that SS-LE in a population protocol (SS-LE PP) for n agents requires at least n agent-states, and gave a SS-LE PP with n agent-states for n agents. MPP is a model of distributed computation, introduced by Chatzigiannakis, Michail and Spirakis (2009) as an extension of PP allowing an extra memory on every agents pair. While they showed that MPP is stronger than PP in general, it was not known if a MPP can really reduce the space complexity of SS-LE with respect to agent-states. We in this paper give a SS-LE MPP with (2/3)n agent-states and a single bit memory on every agents pair for n agents. We also show that there is no SS-LE MPP with any constant agent-states and any constant size memory on each agents-pair for general n agents.

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

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

U2 - 10.1007/978-3-642-17653-1_35

DO - 10.1007/978-3-642-17653-1_35

M3 - Conference contribution

AN - SCOPUS:78650909527

SN - 3642176526

SN - 9783642176524

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

SP - 491

EP - 503

BT - Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings

ER -