Mean-Field Analysis for the Evaluation of Gossip Protocols

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

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    25 Citations (Scopus)
    266 Downloads (Pure)


    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-��?eld 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 in��?nity, however, mean-��?eld 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
    Title of host publicationIEEE Sixth International Conference on the Quantitative Evaluation of Systems, (QEST '09)
    Place of PublicationLos Alamitos
    Number of pages10
    ISBN (Print)978-0-7695-3808-2
    Publication statusPublished - Sept 2009
    Event6th International Conference on Quantitative Evaluation of SysTems, QEST 2009 - Technical University of Budapest, Budapest, Hungary
    Duration: 13 Sept 200916 Sept 2009
    Conference number: 6

    Publication series

    PublisherIEEE Computer Society Press


    Conference6th International Conference on Quantitative Evaluation of SysTems, QEST 2009
    Abbreviated titleQEST
    Internet address


    • IR-70227
    • EWI-17653
    • METIS-266457

    Cite this