Mean-field framework for performance evaluation of pushpull gossip protocols
conference paper
Gossip protocols are designed to operate in very large, decentralised networks. A node in such a networkbases 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 memoryconsumption. We employmean-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.
TNO Identifier
954288
ISSN
01665316
Publisher
Elsevier
Source title
Performance Evaluation
Pages
157-179
Files
To receive the publication files, please send an e-mail request to TNO Repository.