MultiLayer compressed counting bloom filters

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 933-941

  Ficara, Domenico ^a   Giordano, Stefano ^a   Procissi, Gregorio ^a   Vitucci, Fabio ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Counting bloom filter; Hashing functions; Huffman coding; Multilayer structure; Network processor

Indexed keywords

BLOOMS (METAL); CODES (SYMBOLS); COMPUTER NETWORKS; PROBABILITY; WAVE FILTERS;

COUNTING BLOOM FILTER; HASHING FUNCTIONS; HUFFMAN CODING; MULTILAYER STRUCTURE; NETWORK PROCESSOR;

DATA STRUCTURES;

EID: 51349107047     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.71     Document Type: Conference Paper

References (14)

1. B. Bloom, "Space/time trade-offs in hash coding with allowable errors," Communications of the ACM, vol. 13, no. 7, pp. 422-426, July 1970.
2. A. Broder and M. Mitzenmacher, "Network applications of bloom filters: A survey," Internet Mathematics, vol. 1, no. 4, 2005. [Online]. Available: http://www.internetmathematics.org/volumes/1/4/Broder.pdf
3. L. Fan, P. Cao, J. Almeida, and A. Z. Broder, "Summary cache: a scalable wide-area web cache sharing protocol," SIGCOMM Comput. Commun. Rev., vol. 28, no. 4, pp. 254-265, 1998.
4. M. Mitzenmacher, "Compressed bloom filters." in PODC '01: Proc. of the twentieth annual ACM symposium on Principles of distributed computing. New York, NY. USA: ACM Press. 2001, pp. 144-150.
5. A. Kirsch and M. Mitzenmacher, "Distance-sensitive bloom filters," in ALENEX '06: Proc of Algorithm Engineering and Experiments, 2006.
6. D. Guo, J. Wu. H. Chen, and X. Luo, "Theory and network applications of dynamic bloom filters." in Proc. of INFOCOM 2006, 25th IEEE International Conference on Computer Communications., vol. 1, 2006.
7. A. Kumar, J. J. Xu, L. Li, and J. Wang. "Space-code bloom filter for efficient traffic flow measurement," in IMC '03: Proc. of the 3rd ACM SIGCOMM conference on Internet measurement. New York. NY, USA: ACM Press, 2003, pp. 167-172.
8. S. Cohen and Y. Marias, "Spectral bloom filters," in SIGMOD '03: Proc. of the 2003 ACM SIGMOD international conference on Management of data. New York, NY. USA: ACM Press. 2003, pp. 241-252.
9. J. Aguilar-Saborit, P. Trancoso. V. Muntes-Mulero, and J. L. LarribaPey, "Dynamic count filters," SIGMOD Rec., vol. 35, no. 1, pp. 26-32, 2006.
10. F. Bonomi, M. Mitzenmacher. R. Panigrahy, S. Singh, and G. Varghese. "An improved construction for counting bloom filters." in LNCS 4168, 14th Annual European Symposium on Algorithms. 2006, pp. 684-695.
11. H. Song. S. Dharmapurikar, J. Turner, and J. Lockwood. "Fast hash table lookup using extended bloom filter: an aid to network processing," in SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, airhitectures, and protocols for computer communications. New York, NY, USA: ACM, 2005, pp. 181-192.
12. F. C. Botelho and N. Ziviani, "External perfect hashing for very large key sets," in 16th ACM Conference on Information and Knowledge Management (CIKM07), November 2007.
13. http://www.intel.com/design/network/products/npfamily/ixp2805.htm.
14. Intel® IXP2800 Hardware reference manual.