Round-Delayed Amnesiac Flooding
This work addresses theoretical challenges in distributed protocols for communication-delay settings, providing incremental insights into flooding behavior.
The paper tackled the problem of analyzing Round-Delayed Amnesiac Flooding (RDAF) under adversarial delays, establishing that flooding always terminates on acyclic graphs but can fail on cyclic ones, and showing termination is undecidable with arbitrary adversaries but decidable under Eventually Periodic Adversaries.
We present a comprehensive analysis of Round-Delayed Amnesiac Flooding (RDAF), a variant of Amnesiac Flooding that introduces round-based asynchrony through adversarial delays. We establish fundamental properties of RDAF, including termination characteristics for different graph types and decidability results under various adversarial models. Our key contributions include: (1) a formal model of RDAF incorporating round-based asynchrony, (2) a proof that flooding always terminates on acyclic graphs despite adversarial delays, (3) a construction showing non-termination is possible on any cyclic graph, (4) a demonstration that termination is undecidable with arbitrary computable adversaries, and (5) the introduction of Eventually Periodic Adversaries (EPA) under which termination becomes decidable. These results enhance our understanding of flooding in communication-delay settings and provide insights for designing robust distributed protocols.