Content-Oblivious Leader Election on Rings
Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin

TL;DR
This paper presents a leader election algorithm for ring networks in content-oblivious computation, removing the need for a root node and establishing bounds on message complexity, with extensions to non-oriented rings.
Contribution
It introduces the first content-oblivious leader election algorithm for rings without a root, with proven message complexity bounds and extensions to non-oriented rings.
Findings
Message complexity is O(n*ID_max) on oriented rings.
Lower bound of Omega(n*log(ID_max/n)) messages for leader election.
Algorithm reaches quiescence but not termination on non-oriented rings.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
