TY - GEN
T1 - Content-Oblivious Leader Election on Rings
AU - Frei, Fabian
AU - Gelles, Ran
AU - Ghazy, Ahmed
AU - Nolin, Alexandre
N1 - Publisher Copyright: © Fabian Frei, Ran Gelles, Ahmed Ghazy, and Alexandre Nolin.
PY - 2024/10/24
Y1 - 2024/10/24
N2 - 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 · IDmax), where IDmax is the maximal assigned ID. As it turns out, this dependency on IDmax is inherent: we show a lower bound of Ω(n log(IDmax/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.
AB - 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 · IDmax), where IDmax is the maximal assigned ID. As it turns out, this dependency on IDmax is inherent: we show a lower bound of Ω(n log(IDmax/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.
KW - Content-Oblivious Computation
KW - Faulty Communication
KW - Leader Election
KW - Ring Networks
KW - Ring Orientation
UR - http://www.scopus.com/inward/record.url?scp=85208431730&partnerID=8YFLogxK
U2 - https://doi.org/10.4230/LIPIcs.DISC.2024.26
DO - https://doi.org/10.4230/LIPIcs.DISC.2024.26
M3 - منشور من مؤتمر
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 38th International Symposium on Distributed Computing, DISC 2024
A2 - Alistarh, Dan
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 38th International Symposium on Distributed Computing, DISC 2024
Y2 - 28 October 2024 through 1 November 2024
ER -