Work

Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape

Year: 2025

Type: conference-paper

Abstract: Broadcast is a central problem in distributed computing. Recently, Hussak and Trehan [PODC'19/DC'23] proposed a stateless broadcasting protocol (Amnesiac Flooding), which was surprisingly proven to terminate in asymptotically optimal time (linear in the diameter of the network). However, it remains unclear: (i) Are there other stateless terminating broadcast algorithms with the desirable properties of Amnesiac Flooding, (ii) How robust is Amnesiac Flooding with respect to faults?

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733523

Authors: Henry Austin, Maximilien Gadouleau, George Mertzios, Amitabh Trehan

Institution: Durham University

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funder: Engineering and Physical Sciences Research Council

Awards: Algorithmic Aspects of Temporal Graphs, Compact Self-Healing and Routing Over Low Memory Nodes (COSHER)