Mean-field analysis for the evaluation of gossip protocols

Rena Bakhshi, L. Cloth, Wan Fokkink, Boudewijn R.H.M. Haverkort

Research output: Contribution to journalArticleScientificpeer-review

6 Citations (Scopus)

Abstract

Gossip protocols are designed to operate in very large, decentralised networks. A node in such a network bases its decision to interact (gossip) with another node on its partial view of the global system. Because of the size of these networks, analysis of gossip protocols is mostly done using simulation, which tend to be expensive in computation time and memory consumption. We introduce mean-field analysis as an analytical method to evaluate gossip protocols. Nodes in the network are represented by small identical stochastic models. Joining all nodes would result in an enormous stochastic process. If the number of nodes goes to infinity, however, mean-field analysis allows us to replace this intractably large stochastic process by a small deterministic process. This process approximates the behaviour of very large gossip networks, and can be evaluated using simple matrix-vector multiplications.
Original languageEnglish
Pages (from-to)32-39
Number of pages8
JournalPerformance Evaluation Review
Volume36
Issue numberWP 08-02/3
DOIs
Publication statusPublished - Dec 2008
Externally publishedYes

Keywords

  • EWI-14938
  • IR-65330
  • METIS-255151

Fingerprint Dive into the research topics of 'Mean-field analysis for the evaluation of gossip protocols'. Together they form a unique fingerprint.

Cite this