Controlling Gossip Protocol Infection Pattern Using Adaptive Fanout

Authors:
Satish Verma;Wei Tsang Ooi
Affiliations:
National University of Singapore;National University of Singapore
Venue:
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Year:
2005

Citing 0
Cited 8

Analysis and implementation of Gossip-based P2P streaming with distributed incentive mechanisms for peer cooperation

Advances in Multimedia
On the complexity of asynchronous gossip

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Simulation of scale-free networks

Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Multiplayer Online Games over scale-free networks: a viable solution?

Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
Content and location addressable overlay network for wireless multimedia communication

MMM'07 Proceedings of the 13th International conference on Multimedia Modeling - Volume Part II
P2P multimedia sharing over MANET

MMM'07 Proceedings of the 13th International conference on Multimedia Modeling - Volume Part II
Adaptive event dissemination for peer-to-peer multiplayer online games

Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
Asynchronous gossip

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose and evaluate a model for controlling infection patterns defined over rounds or real time in a gossip-based protocol using adaptive fanout. We model three versions of gossip-based protocols: the Synchronous Protocol, the PseudoSynchronous Protocol and the Asynchronous Protocol. Our objective is to ensure that the members of a group receive a desired message within a bounded latency with very high probability. We argue that the most important parameter that controls the latency of message delivery is the fanout used during gossiping, i.e., the number of gossip targets chosen in a particular instance of gossip. We formally analyze the three protocols and provide expressions for fanout. We introduce the idea of using variable fanouts in different rounds in the Synchronous Protocol. We define fanout as a function of time for the Asynchronous Protocol such that an expected infection pattern is observed with high probability. For a better understanding of the theoretical model, we develop a PseudoSynchronous Protocol to highlight the modelling done in order to derive time dependent fanout. We show that our protocols generate 驴(n log n) messages, which is optimal for gossip protocols. We aim to use the gossiping mechanism for large-scale group communication with soft real time constraints. This would alleviate the dependence on tree-based deterministic protocols which usually lack scalability.