Mean-field analysis for the evaluation of gossip protocols
conference paper
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, that tend to be expensive in computation time and memory consumption. We employ mean-field approximation for an analytical evaluation of 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.
Topics
Analytical evaluationComputation timeDecentralisedDeterministic processGlobal systemsGossip protocolsMatrix vector multiplicationMean field analysisMean field approximationMemory consumptionPartial viewsStochastic processComputer simulationRandom processesStochastic modelsStochastic systemsNetwork protocols
TNO Identifier
954035
Repository link
Publisher
IEEE
Article nr.
5290827
Source title
QEST - 6th International Conference on the Quantitative Evaluation of Systems, QEST - 6th International Conference on the Quantitative Evaluation of Systems, 13 September 2009 through 16 September 2009
Pages
247-256
Files
To receive the publication files, please send an e-mail request to TNO Repository.