Polynomial anonymous dynamic distributed computing without a unique leader

Dariusz R. Kowalski, Miguel A. Mosteiro

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

Abstract

Counting the number of nodes in Anonymous Dynamic Networks is enticing from an algorithmic perspective: an important computation in a restricted platform with promising applications. Starting with Michail, Chatzigiannakis, and Spirakis [18], a flurry of papers sped up the running time guarantees from doubly-exponential to polynomial [16]. There is a common theme across all those works: a distinguished node is assumed to be present, because Counting cannot be solved deterministically without at least one. In the present work we study challenging questions that naturally follow: how to efficiently count with more than one distinguished node, or how to count without any distinguished node. More importantly, what is the minimal information needed about these distinguished nodes and what is the best we can aim for (count precision, stochastic guarantees, etc.) without any. We present negative and positive results to answer these questions. To the best of our knowledge, this is the first work that addresses them.

Original languageEnglish (US)
Title of host publication46th International Colloquium on Automata, Languages, and Programming, ICALP 2019
EditorsChristel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771092
DOIs
StatePublished - Jul 1 2019
Externally publishedYes
Event46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 - Patras, Greece
Duration: Jul 9 2019Jul 12 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume132
ISSN (Print)1868-8969

Conference

Conference46th International Colloquium on Automata, Languages, and Programming, ICALP 2019
CountryGreece
CityPatras
Period7/9/197/12/19

Fingerprint

Distributed computer systems
Polynomials

Keywords

  • Anonymous Dynamic Networks
  • Counting
  • Distributed algorithms

ASJC Scopus subject areas

  • Software

Cite this

Kowalski, D. R., & Mosteiro, M. A. (2019). Polynomial anonymous dynamic distributed computing without a unique leader. In C. Baier, I. Chatzigiannakis, P. Flocchini, & S. Leonardi (Eds.), 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 [147] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 132). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2019.147

Polynomial anonymous dynamic distributed computing without a unique leader. / Kowalski, Dariusz R.; Mosteiro, Miguel A.

46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. ed. / Christel Baier; Ioannis Chatzigiannakis; Paola Flocchini; Stefano Leonardi. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 147 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 132).

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

Kowalski, DR & Mosteiro, MA 2019, Polynomial anonymous dynamic distributed computing without a unique leader. in C Baier, I Chatzigiannakis, P Flocchini & S Leonardi (eds), 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019., 147, Leibniz International Proceedings in Informatics, LIPIcs, vol. 132, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, Patras, Greece, 7/9/19. https://doi.org/10.4230/LIPIcs.ICALP.2019.147
Kowalski DR, Mosteiro MA. Polynomial anonymous dynamic distributed computing without a unique leader. In Baier C, Chatzigiannakis I, Flocchini P, Leonardi S, editors, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2019. 147. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.ICALP.2019.147
Kowalski, Dariusz R. ; Mosteiro, Miguel A. / Polynomial anonymous dynamic distributed computing without a unique leader. 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. editor / Christel Baier ; Ioannis Chatzigiannakis ; Paola Flocchini ; Stefano Leonardi. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{8720f780a16440cebe89aecfa2d4cd66,
title = "Polynomial anonymous dynamic distributed computing without a unique leader",
abstract = "Counting the number of nodes in Anonymous Dynamic Networks is enticing from an algorithmic perspective: an important computation in a restricted platform with promising applications. Starting with Michail, Chatzigiannakis, and Spirakis [18], a flurry of papers sped up the running time guarantees from doubly-exponential to polynomial [16]. There is a common theme across all those works: a distinguished node is assumed to be present, because Counting cannot be solved deterministically without at least one. In the present work we study challenging questions that naturally follow: how to efficiently count with more than one distinguished node, or how to count without any distinguished node. More importantly, what is the minimal information needed about these distinguished nodes and what is the best we can aim for (count precision, stochastic guarantees, etc.) without any. We present negative and positive results to answer these questions. To the best of our knowledge, this is the first work that addresses them.",
keywords = "Anonymous Dynamic Networks, Counting, Distributed algorithms",
author = "Kowalski, {Dariusz R.} and Mosteiro, {Miguel A.}",
year = "2019",
month = "7",
day = "1",
doi = "10.4230/LIPIcs.ICALP.2019.147",
language = "English (US)",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi",
booktitle = "46th International Colloquium on Automata, Languages, and Programming, ICALP 2019",
address = "Germany",

}

TY - GEN

T1 - Polynomial anonymous dynamic distributed computing without a unique leader

AU - Kowalski, Dariusz R.

AU - Mosteiro, Miguel A.

PY - 2019/7/1

Y1 - 2019/7/1

N2 - Counting the number of nodes in Anonymous Dynamic Networks is enticing from an algorithmic perspective: an important computation in a restricted platform with promising applications. Starting with Michail, Chatzigiannakis, and Spirakis [18], a flurry of papers sped up the running time guarantees from doubly-exponential to polynomial [16]. There is a common theme across all those works: a distinguished node is assumed to be present, because Counting cannot be solved deterministically without at least one. In the present work we study challenging questions that naturally follow: how to efficiently count with more than one distinguished node, or how to count without any distinguished node. More importantly, what is the minimal information needed about these distinguished nodes and what is the best we can aim for (count precision, stochastic guarantees, etc.) without any. We present negative and positive results to answer these questions. To the best of our knowledge, this is the first work that addresses them.

AB - Counting the number of nodes in Anonymous Dynamic Networks is enticing from an algorithmic perspective: an important computation in a restricted platform with promising applications. Starting with Michail, Chatzigiannakis, and Spirakis [18], a flurry of papers sped up the running time guarantees from doubly-exponential to polynomial [16]. There is a common theme across all those works: a distinguished node is assumed to be present, because Counting cannot be solved deterministically without at least one. In the present work we study challenging questions that naturally follow: how to efficiently count with more than one distinguished node, or how to count without any distinguished node. More importantly, what is the minimal information needed about these distinguished nodes and what is the best we can aim for (count precision, stochastic guarantees, etc.) without any. We present negative and positive results to answer these questions. To the best of our knowledge, this is the first work that addresses them.

KW - Anonymous Dynamic Networks

KW - Counting

KW - Distributed algorithms

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

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

U2 - 10.4230/LIPIcs.ICALP.2019.147

DO - 10.4230/LIPIcs.ICALP.2019.147

M3 - Conference contribution

AN - SCOPUS:85069213672

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019

A2 - Baier, Christel

A2 - Chatzigiannakis, Ioannis

A2 - Flocchini, Paola

A2 - Leonardi, Stefano

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -