An index-split Bloom filter for deep packet inspection

DOI10.1007/S11432-010-4132-4MaRDI QIDQ543154zbMATH OpenOpenAlexFDO

Authors Kun Huang, Dafang Zhang

Publication date 17 June 2011

Published in Science China Information Sciences (Search for Journal in Brave)

Full work available at URL http://engine.scichina.com/doi/10.1007/s11432-010-4132-4

zbMATH Keywords

Bloom filterdeep packet inspectionhash tablenetwork securitypacket processing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Internet topics (68M11) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Fast packet inspection using state-based Bloom filter engine
• A cache architecture for counting bloom filters: theory and application
• Network Applications of Bloom Filters: A Survey
• Cache-, hash-, and space-efficient bloom filters
• Deep packet inspection with delayed signature matching in network auditing

Cites work

• Efficient string matching
• scientific article; zbMATH DE number 2207623 (Why is no real title available?)
• Less hashing, same performance: Building a better Bloom filter
• Network Applications of Bloom Filters: A Survey

Cited in

(2)

• Deep packet inspection with delayed signature matching in network auditing
• Fast packet inspection using state-based Bloom filter engine

This page was built for publication: An index-split Bloom filter for deep packet inspection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543154)