Multi Hashing Low Power Bloom Filter Architectures for Network Applications

Abstract

A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support network and database query systems. Although Bloom filters were invented in the 1970's and have been heavily used in database applications, they have only recently received widespread attention in the networking literature. Software applications frequently fail to identify so many signatures through comparisons at very high speeds. We introduce a low power bloom filter architectures which is space and power effective in hardware platforms. Instead of working on programming phase or technology, our work concentrated on look up techniques of Bloom filters. We have chosen better hash function to be utilized in hardware applications of Bloom filter by FPGA implementation. Power analysis shows that decrement in number of hash functions per stage results in power gain.