Aggregated Bloom Filters for Intrusion Detection and Prevention Hardware

—Bloom Filters (BFs) are fundamental building blocks in various network security applications, where packets from high-speed links are processed using state-of-the-art hardwarebased systems. In this paper, we propose Aggregated Bloom Filters (ABFs) to increase the throughput and scalability of BFs. The proposed ABF has two methods to improve average speed and scalability. The first method leverages the query mechanism for hardware BFs. We ptimize queries by removing redundant hash calculations and memory accesses. First, to remove redundancy, the hash functions for each query are calculated sequentially. As soon as we have a no match in any of the hash results, the query is immediately abandoned. We then aggregate multiple queries and query a BF with all of these queries in parallel, which maximizes the throughput of the BF. The second method addresses scalability issues regarding the on-chip memory resources. In most applications multiple BFs are required to store many sets with di...

• Type: Conference
• Year: 2007
• Where: GLOBECOM
• Authors: N. Sertac Artan, Kaustubh Sinkar, Jalpa Patel, H. Jonathan Chao
• Keywords: GLOBECOM 2007, Memory Utilization, On-chip Memory, On-chip Memory Utilization, Telecommunications