Title
Increasing The Power Efficiency Of Bloom Filters For Network String Matching
Abstract
Although software based techniques are widely accepted in computer security systems, there is a growing interest to utilize hardware opportunities in order to compensate for the network bandwidth increases. Recently, hardware based virus protection systems have started to emerge. These type of hardware systems work by identifying the malicious content and removing it from the network streams. In principle, they make use of string matching. Bit by bit, they compare the virus signatures with the bit strings in the network. The Bloom filters are ideal data structures for string matching. Nonetheless, they consume large power when many of them used in parallel to match different virus signatures. In this paper, we propose a new type of Bloom filter architecture which exploits well-known pipelining technique. © 2006 IEEE.
Publication Date
12-1-2006
Publication Title
Proceedings - IEEE International Symposium on Circuits and Systems
Number of Pages
1828-1831
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
Copyright Status
Unknown
Socpus ID
34547348299 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/34547348299
STARS Citation
Kaya, Ilhan and Kocak, Taskin, "Increasing The Power Efficiency Of Bloom Filters For Network String Matching" (2006). Scopus Export 2000s. 7703.
https://stars.library.ucf.edu/scopus2000/7703