Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Cyclone: a broadcast-free dynamic instruction scheduler with selective replay
Proceedings of the 30th annual international symposium on Computer architecture
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
GoCast: Gossip-Enhanced Overlay Multicast for Fast and Dependable Group Communication
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Decentralized Schemes for Size Estimation in Large and Dynamic Groups
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
Communication-efficient distributed monitoring of thresholded counts
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
A geometric approach to monitoring threshold functions over distributed data streams
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Computing separable functions via gossip
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Toward sophisticated detection with distributed triggers
Proceedings of the 2006 SIGCOMM workshop on Mining network data
Asynchronous distributed averaging on communication networks
IEEE/ACM Transactions on Networking (TON)
Decentralized detection of global threshold crossings using aggregation trees
Computer Networks: The International Journal of Computer and Telecommunications Networking
A-GAP: An Adaptive Protocol for Continuous Network Monitoring with Accuracy Objectives
IEEE Transactions on Network and Service Management
IEEE Journal on Selected Areas in Communications
Decentralized real-time monitoring of network-wide aggregates
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
| Hi-index | 0.00 |
We investigate the use of gossip protocols to detect threshold crossings of network-wide aggregates. Aggregates are computed from local device variables using functions such as SUM, AVERAGE, COUNT, MAX and MIN. The process of aggregation and detection is performed using a standard gossiping scheme. A key design element is to let nodes dynamically adjust their neighbor interaction rates according to the distance between the nodes' local estimate of the global aggregate and the threshold itself. We show that this allows considerable savings in communication overhead. In particular, the overhead becomes negligible when the aggregate is sufficiently far above or far below the threshold. We present evaluation results from simulation studies regarding protocol efficiency, quality of threshold detection, scalability, and controllability.