Area Efficient Counting Bloom Filter (A-CBF) design for NIDS
An interesting target for the intruders is computers, since valuable data are fed into it. The need for impeccable intrusion detection system is growing every day. Hardware based Network Intrusion Detection System (NIDS) relies upon power, delay and area. The Counting Bloom Filter (CBF), improves the power and speed of membership test by maintaining a hazy and compact representation of large set to be searched. The authors' proposed architecture utilizes an array of Linear Feedback Shift Register (LFSR) along with tri-state buffers. Circuit simulation is shown for 8-bit count per entry. Simulation results show that proposed architecture is 35% hardware efficient compared to Low-power fast Counting Bloom Filter (L-CBF) and Static-random access memory based Counting Bloom Filter (S-CBF).