The Research of Technology of Bloom Filter Realization in Hardware

Teng Fei Guo; Jian Biao Mao; Zhi Gang Sun

doi:10.4028/www.scientific.net/AEF.6-7.790

Paper Titles

Major Retailing Logistics Management Mechanisms
p.768

Fishery Logistics Insurance Management Schemes
p.773

Logistics Coordination Management Mechanisms
p.778

Phone-Based Restaurant Recommendation System by Using Position Information and Association Rules
p.783

The Research of Technology of Bloom Filter Realization in Hardware
p.790

Design and Implementation of Multi-Channel Data Acquisition Based on μC/OS-III
p.796

Design and Realization of a Certain Type of Radio Power Amplify Circuit Board Detecting and Teaching Platform
p.800

Design and Realization of a Certain Type of Radio Detecting Repair and Training Platform
p.805

Trust Transfer Mechanism for Mobile Internet Access
p.813

HomeAdvanced Engineering ForumAdvanced Engineering Forum Vols. 6-7The Research of Technology of Bloom Filter...

The Research of Technology of Bloom Filter Realization in Hardware

Abstract:

Bloom filter is a space-efficient data with a certain probability of false positive . We present a reusable hardware implementation framework, define a module interface to provide users with a customize module, and introduce the constraints of hardware resources in the analysis of false positive rate against the traditional Bloom filter hardware design and analysis of the Bloom filter false positives. Finally, we make verification and analysis of our design combined with the the NetMagic platform.

By email View Pdf

You have full access to the following eBook

Read eBook

Info:

Periodical:

Advanced Engineering Forum (Volumes 6-7)

Pages:

790-795

DOI:

https://doi.org/10.4028/www.scientific.net/AEF.6-7.790

Citation:

Cite this paper

Online since:

September 2012

Authors:

Teng Fei Guo, Jian Biao Mao, Zhi Gang Sun

Keywords:

Bloom Filter, HBBF, Netmagic Platform

Export:

RIS, BibTeX

Permissions:

Creative Commons CC BY 4.0

Citation:

References

[1] B.H. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of ACM, vol. 13, no. 7, pp.422-426, July (1970).

DOI: 10.1145/362686.362692

Google Scholar

[2] Broder A, Mitzenmacher M. Network Applications of Bloom Filters: A Survey[J]. Internet Mathematics, 2004, 1(4): 485-509.

DOI: 10.1080/15427951.2004.10129096

Google Scholar

[3] Fan, L., Cao, P., Almeida, J., Broder, A.: Summary cache: A scalable wide-area web cachesharing protocol. IEEE/ACM Transactions on Networking (TON) 8 (2000) 281-293.

DOI: 10.1109/90.851975

Google Scholar

[4] S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. Lockwood,. Deep packet inspection using parallel bloom filters,. In Proceedings of High Performance Interconnects, 2003, p.44. 51.

DOI: 10.1109/conect.2003.1231477

Google Scholar

[5] Chen, Y., Kumar, A., Xu, J.: A New Design of Bloom Filter for Packet Inspection Speedup. In: IEEE Global Telecommunications Conference, (2007).

DOI: 10.1109/glocom.2007.8

Google Scholar

[6] Li Tao, et al. A Novel Packet Processing Model for Next-Generation Internet Experiment Platform-EasySwitch. The 8th China National Computer Conference (CNCC2011), Shenzhen, (2011).

Google Scholar

[7] Taoli, Zhigang Sun, ChunboJia, Qi Su, Myungjin Lee. Using NetMagic to Observe Fine-Grained Per-Flow Latency Measurements . Proceedings of the ACM SIGCOMM 2011, Toronto, Canada, August, 2011: 466-467.

DOI: 10.1145/2043164.2018524

Google Scholar

[8] http: /www. netmagic. org.

Google Scholar

[9] Networking Named Content, Van Jacobson et al. CoNEXT'09, Rome, Italy, (2009).

Google Scholar

[10] Breslau, L., et al.: Web caching and zipf-like distributions: Evidence and implica-tions. In: In INFOCOM. p.126–134 (1999).

Google Scholar