Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A mean-field model for multiple TCP connections through a buffer implementing RED
Performance Evaluation
A mean-field analysis of short lived interacting TCP flows
Proceedings of the joint international conference on Measurement and modeling of computer systems
The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Balancing Queues by Mean Field Interaction
Queueing Systems: Theory and Applications
Dynamic probabilistic broadcasting in MANETs
Journal of Parallel and Distributed Computing
Correctness of a gossip based membership protocol
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Integrating streaming and file-transfer Internet traffic: fluid and diffusion approximations
Queueing Systems: Theory and Applications
A Generic Mean Field Convergence Result for Systems of Interacting Objects
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Gossiping in distributed systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Exploring the interdisciplinary connections of gossip-based systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Analysis of Large Scale Interacting Systems by Mean Field Method
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Gossip-based clock synchronization for large decentralized systems
SelfMan'06 Proceedings of the Second IEEE international conference on Self-Managed Networks, Systems, and Services
How to model and analyze gossiping protocols?
ACM SIGMETRICS Performance Evaluation Review
Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks
Performance Evaluation
Mean-field framework for performance evaluation of push-pull gossip protocols
Performance Evaluation
Markovian agent modeling swarm intelligence algorithms in wireless sensor networks
Performance Evaluation
Combined optimal control of activation and transmission in delay-tolerant networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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.