## 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 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.

Original language | English |
---|---|

Title of host publication | PODC 2024 - Proceedings of the 2024 ACM Symposium on Principles of Distributed Computing |

Publisher | Association for Computing Machinery |

Pages | 549-552 |

Number of pages | 4 |

ISBN (Electronic) | 9798400706684 |

DOIs | |

State | Published - 17 Jun 2024 |

Event | 43rd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2024 - Nantes, France Duration: 17 Jun 2024 → 21 Jun 2024 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Principles of Distributed Computing |
---|

### Conference

Conference | 43rd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2024 |
---|---|

Country/Territory | France |

City | Nantes |

Period | 17/06/24 → 21/06/24 |

### Bibliographical note

Publisher Copyright:© 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

## Keywords

- content-oblivious computation
- fully defective networks
- leader election
- ring networks