In network security applications, such as network intrusion detection, string matching is used to scan packets to detect malicious content. Bloom filters have drawn a great attention due to the fact that they can provide constant lookup times at the cost of small false positives. A fault in Bloom filters, however, cannot guarantee no-false-negatives. In this paper, we present a property-based technique for tolerating faults in Bloom filters for deep packet inspection. It employs a single spare hashing unit in each Bloom filter to detect and eliminate false negatives until the spare itself is faulty. The design is simple to be implemented in hardware. Moreover, the process for eliminating false negatives can be done without reducing the system throughput. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Choi, Y. H., & Lee, M. H. (2007). A property-based technique for tolerating faults in bloom filters for deep packet inspection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4610 LNCS, pp. 539–548). Springer Verlag. https://doi.org/10.1007/978-3-540-73547-2_55
Mendeley helps you to discover research relevant for your work.