Mean-field analysis for the evaluation of gossip protocols

Share/Save/Bookmark

Bakhshi, Rena and Cloth, Lucia and Fokkink, Wan and Haverkort, Boudewijn R. (2008) Mean-field analysis for the evaluation of gossip protocols. ACM SIGMETRICS Performance Evaluation Review, 36 (3). pp. 31-39. ISSN 0163-5999

[img]
Preview
PDF
304Kb
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.
Item Type:Article
Copyright:© 2008 ACM
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65330
Official URL:http://doi.acm.org/10.1145/1481506.1481513
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 255151