Mean-field analysis for the evaluation of gossip protocols

Rena Bakhshi, L. Cloth, Wan Fokkink, Boudewijn R.H.M. Haverkort

    Research output: Contribution to journalArticleAcademicpeer-review

    6 Citations (Scopus)
    68 Downloads (Pure)

    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.
    Original languageUndefined
    Article number10.1145/1481506.1481513
    Pages (from-to)32-39
    Number of pages8
    JournalSIGMETRICS performance evaluation review
    Volume36
    Issue numberWP 08-02/3
    DOIs
    Publication statusPublished - Dec 2008

    Keywords

    • EWI-14938
    • IR-65330
    • METIS-255151

    Cite this