Self-Correcting Gossip Protocols
For distributed computing researchers, this work addresses error correction in gossip protocols without central coordination, though it is an incremental extension of existing epistemic logic approaches.
The paper proposes a dynamic epistemic logic for self-correcting gossip protocols that can correct transmission errors without a central authority, and analyzes the impact on optimality compared to bounded memory and full information protocols.
We investigate self-correcting gossip protocols with errors. In distributed computing, protocols with errors have been widely investigated in temporal epistemic logics. Instead, we propose a dynamic epistemic logic. We show how to correct transmission errors due to faulty messages without a central authority coordinating protocol execution, how this affects optimality, and how this compares to bounded memory and full information protocols.