Adaptive bloom filter: A space-efficient counting algorithm for unpredictable network traffic

IEICE Transactions on Information and Systems

Volumn E91-D, Issue 5, 2008, Pages 1292-1299

  Matsumoto, Yoshihide ^a   Hazeyama, Hiroaki ^a   Kadobayashi, Youki ^a  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Bloom Filter; Burst traffic; Counting

Indexed keywords

BANDPASS FILTERS; DATA STRUCTURES; HASH FUNCTIONS;

BLOOM FILTERS; BURST TRAFFIC; COUNTING; COUNTING BLOOM FILTERS; DISTINCT ELEMENTS; MATHEMATICAL ANALYSIS; NETWORK PROCESSING; PACKET CLASSIFICATION;

ADAPTIVE FILTERS;

EID: 68149178269     PISSN: 09168532     EISSN: 17451361     Source Type: Journal    
DOI: 10.1093/ietisy/e91-d.5.1292     Document Type: Article

References (9)

1. B.H. Bloom, "Space/time trade-offs in hash coding with allowable errors," Commun. ACM, vol.13, no.7, pp.422-426, 1970.
2. F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese, "An improved construction for counting bloom filters," ESA, pp.684-695, 2006.
3. S. Cohen and Y. Matias, "Spectral bloom filters," SIGMOD Conference, pp.241-252, 2003.
4. S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. Lockwood, "Deep packet inspection using parallel bloom filters," IEEE Micro, vol.24, no.1, pp.52-61, Jan/Feb, 2004.
5. L. Fan, P. Cao, J. Almeida, and A.Z. Broder, "Summary cache: A scalable wide-area Web cache sharing protocol," IEEE/ACM Trans. Netw., vol.8, no.3, pp.281-293, 2000.
6. N. Jain, M. Dahlin, and R. Tewari, "Using bloom filters to refine Web search results," WebDB, pp.25-30, 2005.
7. A. Kumar, J. Xu, J. Wang, O. Spatscheck, and L. Li, "Space-code bloom filter for efficient per-flow traffic measurement," Infocom, 2004, 2004.
8. A.C. Snoeren, "Hash-based ip traceback," SIGCOMM '01: Proc. 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp.3-14, New York, NY, USA, ACM Press, 2001.
9. H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood, "Fast hash table lookup using extended bloom filter: An aid to network processing," ACM SIGCOMM, Philadelphia, PA, Aug. 2005.