An Analytical Model of Information Dissemination for a Gossip-based Protocol

TL;DR

This paper presents an analytical model for a hybrid push-pull gossip protocol, analyzing its efficiency in spreading information and optimizing buffer size, validated through extensive simulations.

Contribution

It introduces a novel analytical framework for hybrid gossip protocols, providing insights into dissemination speed and buffer optimization.

Findings

Optimal buffer size for fast replication identified

Model accurately predicts dissemination speed in large networks

Simulation confirms analytical results

Abstract

We develop an analytical model of information dissemination for a gossiping protocol that combines both pull and push approaches. With this model we analyse how fast an item is replicated through a network, and how fast the item spreads in the network, and how fast the item covers the network. We also determine the optimal size of the exchange buffer, to obtain fast replication. Our results are confirmed by large-scale simulation experiments.