2026-08-07T12:10:50Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:21252 2024-10-24T07:40:08Z ddc:004 open_access

Content-Oblivious Leader Election on Rings Frei, Fabian Gelles, Ran Ghazy, Ahmed Nolin, Alexandre Content-Oblivious Computation Faulty Communication Leader Election Ring Networks Ring Orientation In content-oblivious computation, n nodes wish to compute a given task over an asynchronous network that suffers from an extremely harsh type of noise, which corrupts the content of all messages across all channels. In a recent work, Censor-Hillel, Cohen, Gelles, and Sela (Distributed Computing, 2023) showed how to perform arbitrary computations in a content-oblivious way in 2-edge connected networks but only if the network has a distinguished node (called root) to initiate the computation. Our goal is to remove this assumption, which was conjectured to be necessary. Achieving this goal essentially reduces to performing a content-oblivious leader election since an elected leader can then serve as the root required to perform arbitrary content-oblivious computations. We focus on ring networks, which are the simplest 2-edge connected graphs. On oriented rings, we obtain a leader election algorithm with message complexity O(n ⋅ ID_max), where ID_max is the maximal assigned ID. As it turns out, this dependency on ID_max is inherent: we show a lower bound of Ω(n log(ID_max/n)) messages for content-oblivious leader election algorithms. We also extend our results to non-oriented rings, where nodes cannot tell which channel leads to which neighbor. In this case, however, the algorithm does not terminate but only reaches quiescence. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Fabian Frei and Ran Gelles and Ahmed Ghazy and Alexandre Nolin 2024 Is Part Of LIPIcs, Volume 319, 38th International Symposium on Distributed Computing (DISC 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2024.26 urn:nbn:de:0030-drops-212527 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.26 eng https://creativecommons.org/licenses/by/4.0/legalcode