A Survey of Communicate Efficient Algorithms of Distributed Data Stream

In distributed data stream systems, the available communication bandwidth is a bottleneck. Thus, effective solutions have to be communication efficient, and provide continuous, guaranteed quality queries. Aimed at this practical problem, based on the analysis of current distributed data stream processing algorithms, a general tracking frame has been summarized, which based on three principles of minimizing global information, using summaries to capture whole data streams, and using prediction model to seeking stability.