Lightweight Monitoring of Distributed Streams

Arnon Lazerson, Daniel Keren, Assaf Schuster · 2016

As data becomes dynamic, large, and distributed, there is increasing demand for what have become known as distributed stream algorithms. Since continuously collecting the data to a central server and processing it there incurs very high communication and computation complexities, it is advantageous to define local conditions at the nodes, such that -- as long as they are maintained -- some desirable global condition holds.

Read the paper · More papers on PaperTik