Advanced search
Publication Cover
Australian Journal of Electrical and Electronics Engineering Volume 8, 2011 - Issue 3
Submit an article Journal homepage
7
Views
0
CrossRef citations to date
0
Altmetric
Technical Paper

Low Power Bloom Filter Architectures Using Multi-Stage Lookup Technique

M. ArunSri Krishna College of Engineering & Technology,Coimbatore,IndiaCorrespondence[email protected]
View further author information
&
A. KrishnanKSR College of Engineering,Tiruchengode,IndiaView further author information
Pages 179-188 | Received 12 Nov 2009, Accepted 02 Jun 2011, Published online: 16 Nov 2015

References

  • Arun, M. & Krishnan, A. 2008, “Design and Implementation of a String Matching System for Network Intrusion Detection using FPGA-based low power multiple-hashing Bloom Filters”, IJCSA, Vol. 1, No. 3, pp. 186–189.
  • Attig, M., Dharmapurikar, S. & Lockwood, J. W. 2004, “Implementation Results of Bloom Filters for String Matching”, Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’04), pp. 345–346.
  • Bloom, B. 1970, “Space/Time Trade-Offs in Hash Coding with Allowable Errors”, Commun. ACM, Vol. 13, No. 7, pp. 422–426.
  • Broder, A. & Mitzenmacher M. 2003, “Network Applications of Bloom Filters: A Survey”, Internet Mathematics, Vol. 1, No. 4, pp. 485–509.
  • Carter, J. L. & Wegman, M. 1978, “Universal classes of hash functions”, Journal of Computer and System Sciences, Vol. 18, pp. 143–154.
  • Cuena-Acuna, F. M., Peery, C., Martin, R. P. & Nguyen, T. D. 2004, “PlantP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities”, Proc. 12th IEEE Int’l Symp. High Performance Distributed Computing, pp. 236–249.
  • Dharmapurikar, S. & Lockwood, J. W. 2006, “Fast and Scalable Pattern Matching for Network Intrusion Detection Systems”, IEEE Journal on Selected Areas in Communications, Vol. 24, No. 10, pp. 1781–1792.
  • Dharmapurikar, S., Krishnamurthy, P., Sproull, T. S. & Lockwood, J. W. 2003, “Deep Packet Inspection Using Parallel Bloom Filters”, IEEE Micro, Vol. 24, No. 1, pp. 52–61.
  • Fan, L., Cao, P., Almeida, J. & Broder, A. 2000, “Summary Cache: A Scalable Wide Area Web Cache Sharing Protocol”, IEEE/ACM Trans. Networking, Vol. 8, No. 3, pp. 281–293.
  • Hodes, T. D., Czerwinski, S. E. & Zhao, B. Y. 2002, “An Architecture for Secure Wide Area Service Discovery”, Wireless Networks, Vol. 8, No. 2/3, pp. 213–230.
  • Kaya, I. & Kocak, T. 2006, “A Low Power Lookup Technique for Multi-Hashing Network Applications”, IEEE Computer Society, Proceedings of the 2006 Emerging VLSI Technologies and Architectures (ISVLSI’06), pp. 168–177.
  • Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P. & Geels, D. 2000, “Oceanstore: An Architecture for Global-Scale Persistent Storage”, ACM SIGPLAN Notices, Vol. 35, No. 11, pp. 190–201.
  • Mitzenmacher, M. 2002, “Compressed Bloom Filters”, IEEE/ACM Transactions on Networking, Vol. 10, No. 5, pp. 604–612.
  • Mullin, J. K. 1990, “Optimal Semijoins for Distributed Database Systems”, IEEE Trans. Software Eng., Vol. 16, No. 5, pp. 558–560.
  • Reynolds, P. & Vahdat, A. 2003, “Efficient Peer-to-Peer Keyword Searching”, Proc. ACM Int’l Middleware Conf., pp. 21–40.
  • Rhea, S. C. & Kubiatowicz, J. 2004, “Probabilistic Location and Routing”, Proc. IEEE INFOCOM, pp. 1248–1257.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.