Self-Correcting Gossip Protocols

2026-05-07

AI Summary

This work addresses transmission errors in distributed gossip protocols caused by message failures by proposing a decentralized, self-correcting mechanism that requires no central coordination. For the first time, dynamic epistemic logic is integrated into the design of fault-tolerant gossip protocols, enabling automatic error correction in fully decentralized settings through formal modeling. Theoretical analysis and comparative evaluation demonstrate that the proposed protocol maintains information integrity while precisely characterizing the trade-offs among optimality, memory overhead, and fault tolerance. It achieves superior overall performance compared to both bounded-memory and full-information gossip protocols.

Abstract

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.

Problem

• gossip protocols
• transmission errors
• distributed computing
• self-correcting
• faulty messages

Innovation

• self-correcting gossip protocols
• dynamic epistemic logic
• distributed computing
• transmission error correction
• decentralized coordination