Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications.

@inproceedings{Scheuermann2007NearOptimalCO,
  title={Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications.},
  author={Bj{\"o}rn Scheuermann and Martin Mauve},
  booktitle={DIALM-POMC},
  year={2007}
}
Sketches—data structures for probabilistic, duplicate insensitive counting—are central building blocks of a number of recently proposed network protocols, for example in the context of wireless sensor networks. They can be used to perform robust, distributed data aggregation in a broad range of settings and applications. However, the structure of these sketches is very redundant, making effective compression vital if they are to be transmitted over a network. Here, we propose lossless… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

References

Publications referenced by this paper.