Gossip-based aggregate computation: computing faster with non address-oblivious schemes

Authors:
Roberto Di Pietro;Pietro Michiardi
Affiliations:
UNESCO Chair in Data Privacy, Terragona, Spain;Eurecom, Sophia-Antipolis, France
Venue:
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Year:
2008

Citing 3
Cited 1

Randomized rumor spreading

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Gossip-Based Computation of Aggregate Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Randomized gossip algorithms

IEEE Transactions on Information Theory

Optimal gossip-based aggregate computation

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we sketch a novel gossip-based scheme that allows all the nodes in an n-node overlay network to compute a common aggregate (MAX) of their values using O(n log log n) messages within O(log n) rounds of communication. Our result is achieved relaxing the hypothesis that nodes are address-oblivious, raising the question whether this paradigm (address-aware) is more expressive than the address-oblivious one.