Polynomial anonymous dynamic distributed computing without a unique leader

DOI10.1016/J.JCSS.2021.07.002MaRDI QIDQ2237890zbMATH OpenOpenAlexFDO

Authors Dariusz R. Kowalski, Miguel A. Mosteiro

Publication date 28 October 2021

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2104.02937, https://drops.dagstuhl.de/opus/volltexte/2019/10723/

zbMATH Keywords

distributed algorithms counting anonymous dynamic networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

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 [19], 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.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Polynomial anonymous dynamic distributed computing without a unique leader

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2237890)