Efficient gossip-based aggregate computation


Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a novel gossip-based scheme using which all the nodes in an n-node overlay network can compute the common aggregates of MIN, MAX, SUM, AVERAGE, and RANK of their values using O(n log… (More)
DOI: 10.1145/1142351.1142395


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

68 Citations

Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics