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)
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
A class of mean field interaction models for computer and communication systems
Performance Evaluation
Analysis of a gossip protocol in PRISM
ACM SIGMETRICS Performance Evaluation Review
MeanField analysis for the evaluation of gossip protocols
ACM SIGMETRICS Performance Evaluation Review
The age of gossip: spatial mean field regime
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
An analytical model of information dissemination for a gossip-based protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
Brahms: Byzantine resilient random membership sampling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Mean-Field Analysis for the Evaluation of Gossip Protocols
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
On the Impact of Modelling Choices for Distributed Information Spread
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
Automating the Mean-Field Method for Large Dynamic Gossip Networks
QEST '10 Proceedings of the 2010 Seventh International Conference on the 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
Fluid computation of passage-time distributions in large Markov models
Theoretical Computer Science
Mean-field approximations for performance models with generally-timed transitions
ACM SIGMETRICS Performance Evaluation Review
Availability in large networks: global characteristics from local unreliability properties
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Tackling continuous state-space explosion in a Markovian process algebra
Theoretical Computer Science
| 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 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.