期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2014
卷号：3
期号：4
页码：11823
出版社：S&S Publications
摘要：One broadly used method for representingmembership of a set of items is the simple space-efficientrandomized data structure known as Bloom filters. Generallythe regular Bloom filter suffers in terms of powerconsumption and FPR (False Positive Rate). To overcome thiswe proposed two methods. The pipelined Bloom filterarchitecture for k-stages has been proposed to attain thesignificant power saving. The second method is the parallelBloom filter that reduces the FPR. Further a novel Bhsequencescheme is introduced in this pooled pipelined andparallel Bloom filter architecture to reduce the FPR. Throughthis method around 10%-20% of the power saving can beachieved. Bloom filters are used in network securityapplications such as web caches, resource routing, networkmonitoring.
