Mean-field framework for performance evaluation of push–pull gossip protocols

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

Research output: Contribution to journalArticleScientificpeer-review

23 Citations (Scopus)


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 simulations, but these tend to be expensive in computation time and memory consumption. We employ mean-field analysis techniques for the evaluation of gossip protocols. Nodes in the network are represented by small identical stochastic processes. 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)157-179
Number of pages23
JournalPerformance Evaluation
Issue number2
Publication statusPublished - Feb 2011
Externally publishedYes


  • Quantitative evaluation
  • EWI-21074
  • IR-79138
  • Mean-field approximation
  • METIS-284936
  • Gossip protocols


Dive into the research topics of 'Mean-field framework for performance evaluation of push–pull gossip protocols'. Together they form a unique fingerprint.

Cite this