Problem
Research questions and friction points this paper is trying to address.
Amnesiac Flooding
Round-Delayed
Termination
Adversarial Delays
Distributed Protocols
Round-Delayed Amnesiac Flooding
🤖 AI Summary
This study addresses the termination problem of memoryless flooding algorithms under adversarial message delays that induce round-asynchronous behavior. To this end, the authors propose a formal model of round-delayed memoryless flooding and analyze its dynamics across various graph topologies and adversarial models using tools from graph theory and computability theory. Their main contributions include proving that the algorithm always terminates on acyclic graphs but may fail to terminate on graphs containing cycles; showing that termination is undecidable under arbitrary computable adversaries; and introducing a restricted yet practically relevant class of “ultimately periodic” adversaries, under which termination becomes decidable. These results delineate the theoretical boundaries of robustness for distributed flooding protocols in the presence of adversarial communication delays.
📝 Abstract
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.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Round-Delayed Amnesiac Flooding
asynchrony
termination
adversarial delay
Eventually Periodic Adversaries
🔎 Similar Papers
No similar papers found.
