Abstract
In the model of continuous distributed monitoring, a number of observers each see a stream of observations. Their goal is to work together to compute a function of the union of their observations. This can be as simple as counting the total number of observations, or more complex non-linear functions such as tracking the entropy of the induced distribution. Assuming that it is too costly to simply centralize all the observations, it becomes quite challenging to design solutions which provide a good approximation to the current answer, while bounding the communication cost of the observers, and their other resources such as their space usage. This survey introduces this model, and describe a selection results in this setting, from the simple counting problem to a variety of other functions that have been studied.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Distributed Thresholded Counting with Limited Interaction;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24
2. Communication Efficient Algorithms for Bounding and Approximating the Empirical Entropy in Distributed Systems;Entropy;2022-11-05
3. Parallel Weighted Random Sampling;ACM Transactions on Mathematical Software;2022-09-10
4. Truly Perfect Samplers for Data Streams and Sliding Windows;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12
5. AutoMon: Automatic Distributed Monitoring for Arbitrary Multivariate Functions;Proceedings of the 2022 International Conference on Management of Data;2022-06-10