A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Fully pipelined bloom filter architecture
Recently, we proposed a two-stage pipelined Bloom filter architecture to save power for network security applications. In this letter, we generalize the pipelined Bloom filter architecture to k-stage and show that significant power savings can be achieved by employing one hash function per stage. We analytically show that the expected power consumption and latency of the fully pipelined Bloom filter architecture will not be greater than that of the two hash functions and two clock cycles, respectively, however large the number of hash functions is. Furthermore, we discuss the worst-case performance of the proposed architecture. ; Recently, we proposed a two-stage pipelined Bloom filter architecture to save power for network security applications. In this letter, we generalize the pipelined Bloom filter architecture to k-stage and show that significant power savings can be achieved by employing one hash function per stage. We analytically show that the expected power consumption and latency of the fully pipelined Bloom filter architecture will not be greater than that of the two hash functions and two clock cycles, respectively, however large the number of hash functions is. Furthermore, we discuss the worst-case performance of the proposed architecture
Fully pipelined bloom filter architecture
Recently, we proposed a two-stage pipelined Bloom filter architecture to save power for network security applications. In this letter, we generalize the pipelined Bloom filter architecture to k-stage and show that significant power savings can be achieved by employing one hash function per stage. We analytically show that the expected power consumption and latency of the fully pipelined Bloom filter architecture will not be greater than that of the two hash functions and two clock cycles, respectively, however large the number of hash functions is. Furthermore, we discuss the worst-case performance of the proposed architecture. ; Recently, we proposed a two-stage pipelined Bloom filter architecture to save power for network security applications. In this letter, we generalize the pipelined Bloom filter architecture to k-stage and show that significant power savings can be achieved by employing one hash function per stage. We analytically show that the expected power consumption and latency of the fully pipelined Bloom filter architecture will not be greater than that of the two hash functions and two clock cycles, respectively, however large the number of hash functions is. Furthermore, we discuss the worst-case performance of the proposed architecture
Fully pipelined bloom filter architecture
Paynter, M (author) / Koçak, T (author)
2008-11-01
Paynter , M & Koçak , T 2008 , ' Fully pipelined bloom filter architecture ' , IEEE Communications Letters , vol. 12 , no. 11 , pp. 855 - 857 . https://doi.org/10.1109/LCOMM.2008.081176
Article (Journal)
Electronic Resource
English
EQUIPMENT WHERE THE NOTHING FILTER FOR REMOVING WATER-BLOOM
| European Patent Office | 2017
| Springer Verlag | 2022
A Pipelined Architecture for Adaptive Image Compression using DWT and Spectral Classification
| British Library Conference Proceedings | 1997