SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Randomized algorithms
Parallel randomized load balancing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Wireless integrated network sensors
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Scalable Fault-Tolerant Aggregation in Large Process Groups
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
ACM Transactions on Computer Systems (TOCS)
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Epidemic-Style Proactive Aggregation in Large Overlay Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Holistic aggregates in a networked world: distributed tracking of approximate quantiles
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Streaming in a connected world: querying and tracking distributed data streams
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Gossiping in distributed systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Compositional gossip: a conceptual architecture for designing gossip-based applications
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
An unstructured peer-to-peer approach to aggregate node selection
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Brief announcement: locality-based aggregate computation in wireless sensor networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Optimal gossip-based aggregate computation
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Efficient data collection for wireless networks: delay and energy tradeoffs
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Fully decentralized computation of aggregates over data streams
Proceedings of the First International Workshop on Novel Data Stream Pattern Mining Techniques
Identifying frequent items in a network using gossip
Journal of Parallel and Distributed Computing
Fully decentralized computation of aggregates over data streams
ACM SIGKDD Explorations Newsletter
The cost of fault tolerance in multi-party communication complexity
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Networked computing in wireless sensor networks for structural health monitoring
IEEE/ACM Transactions on Networking (TON)
ProFID: Practical frequent items discovery in peer-to-peer networks
Future Generation Computer Systems
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
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 log n) messages within O(log n log log n) rounds of communication. To the best of our knowledge, ours is the first result that shows how to compute these aggregates with high probability using only O(n log log n) messages. In contrast, the best known gossip-based algorithm for computing these aggregates requires O(nlog n) messages and O(log n) rounds. Thus, our algorithm allows system designers to trade off a small increase in round complexity with a significant reduction in message complexity. This can lead to dramatically lower network congestion and longer node lifetimes in wireless and sensor networks, where channel bandwidth and battery life are severely constrained.