Self-Correcting Gossip Protocols

TL;DR

This paper introduces a dynamic epistemic logic framework for self-correcting gossip protocols that handle transmission errors without central coordination, analyzing their efficiency compared to other protocols.

Contribution

It proposes a novel dynamic epistemic logic approach to model and analyze error correction in gossip protocols without central authority.

Findings

Protocols can correct transmission errors dynamically.

Error correction impacts protocol optimality.

Comparison with bounded memory and full information 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.