A view-probability-matrix approach to the modelling of gossiping protocols

Authors:
Thomas Krieger;Martin Riedl;Johann Schuster;Markus Siegle
Affiliations:
University of the German Federal Armed Forces Munich, Department of Computer Science;University of the German Federal Armed Forces Munich, Department of Computer Science;University of the German Federal Armed Forces Munich, Department of Computer Science;University of the German Federal Armed Forces Munich, Department of Computer Science
Venue:
ACM SIGMETRICS Performance Evaluation Review
Year:
2008

Citing 3
Cited 1

The peer sampling service: experimental evaluation of unstructured gossip-based implementations

Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Epidemic Information Dissemination in Distributed Systems

Computer
An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science

How to model and analyze gossiping protocols?

ACM SIGMETRICS Performance Evaluation Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the quantitative analysis of gossiping protocols. In contrast to existing approaches which are entirely based on the simulation of the individual nodes' behaviours, we present a new approach based on summary stochastic models for the peer sampling service. Instead of an ordinary state- and transition-based model, a matrix-based approach is presented. Starting from a basic model with static node population and without ageing of neighbourhood information, refinements of the model are presented which enable the modelling of ageing and dynamic population. The paper also contains some experimental results for the different models introduced in the paper.