Power Analysis of Multiple Hashing Bloom Filter Architecture 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 1970s 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 lookup techniques of bloom filters. We have chosen H3 Universal hash function to be utilized in hardware applications of bloom filter, and power consumption is measured using third party physical layout tool in complementary metal-oxide-semiconductor 60-nm technology. Power consumption of power analysis shows that decrement in number of hash functions per stage results in power gain. Proposed ripple through architecture is implemented in third party field programmable gate array and compared with previous works.