Bloom filters: Design innovations and novel applications

43rd Annual Allerton Conference on Communication, Control and Computing 2005

Volumn 2, Issue , 2005, Pages 1006-1015

  Lu, Yi ^a   Prabhakar, Balaji ^a   Bonomi, Flavio ^b  

^a Stanford University   (United States)

^b CISCO SYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84962091205     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. A. Z. Broder and M. Mitzenmacher. Network applications of bloom filters: A survey. Accepted to Internet Mathematics, 2005.
2. Francis Chang, Wu-Chang Feng, and Kang Li. Approximate caches for packet classification. In Proceeding of IEEE Infocom 2004, Hongkong, 2004.
3. S. Dharmapurikar, P. Krishnamurthy, and D. Taylor. Longest prefix matching using bloom filters. SIGCOMM, (Karlsruhe, Germany), Aug, 2003.
4. Sarang Dharmapurikar, Praveen Krishnamurthy, Todd Sproull, and John Lockwood. Deep packet inspection using parallel bloom filters. HOTI'03: Hot Interconnects 11:2003, Stanford, 8/03.
5. P.C. Dillinger and P. Manolios. Bloom filters in probabilistic verification. FMCAD, Formal Methods in Computer-Aided Design, 2004.
6. C. Estan and G. Varghese. New directions in traffic measurement and accounting. Proceedings of ACM SIGCOMM, 2002.
7. C. Estan, G. Varghese, and M. Fisk. Bitmap algorithms for counting active flows on high speed links. Proceedings of the USENIX/ACM Internet Measurement Conference, October 2003.
8. L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: A scalable wide-area web cache sharing protocol. IEEE/ACM Transaction on Networking, 8(3):281-293, 2000.
9. A. Kirsch and M. Mitzenmacher. Building a better bloom filter. Technical Report of Computer Science Group, Harvard University, (TR-02-05), 2005.
10. A. Kirsch and M. Mitzenmacher. Simple summaries for hashing with multiple choices. 43rd Annual Allerton Conference on Communication, Control and Computing, Sep, 2005.
11. A. Kumar, M. Sung, J. Xu, and J. Wang. Data streaming algorithms for efficient and accurate estimation of flow size distribution. Proceedings of the joint international conference on Measurement and modeling of computer systems, pages 177-188, 2004.
12. A. Kumar, J. Xu, J. Wang, O. Spatschek, and L. Li. Space-code bloom filter for efficient per-flow traffic measurement. Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, pages 167-172, 2003.
13. K. Psounis, A. Ghosh, B. Prabhakar, and G. Wang. A simple algorithm for tracking elephant flows, and taking advantage of power laws. Proceedings of Allerton Conference, 2005.
14. H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood. Fast hash table lookup using extended bloom filter: An aid to network processing. SIGCOMM, (Philadelphia), Aug, 2005.