CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Area Efficient Counting Bloom Filter (A-CBF) design for NIDS

by Brindha.p, Senthilkumar.a
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 70 - Number 4
Year of Publication: 2013
Authors: Brindha.p, Senthilkumar.a
10.5120/11949-7767

Brindha.p, Senthilkumar.a . Area Efficient Counting Bloom Filter (A-CBF) design for NIDS. International Journal of Computer Applications. 70, 4 ( May 2013), 17-21. DOI=10.5120/11949-7767

@article{ 10.5120/11949-7767,
author = { Brindha.p, Senthilkumar.a },
title = { Area Efficient Counting Bloom Filter (A-CBF) design for NIDS },
journal = { International Journal of Computer Applications },
issue_date = { May 2013 },
volume = { 70 },
number = { 4 },
month = { May },
year = { 2013 },
issn = { 0975-8887 },
pages = { 17-21 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume70/number4/11949-7767/ },
doi = { 10.5120/11949-7767 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:31:58.235892+05:30
%A Brindha.p
%A Senthilkumar.a
%T Area Efficient Counting Bloom Filter (A-CBF) design for NIDS
%J International Journal of Computer Applications
%@ 0975-8887
%V 70
%N 4
%P 17-21
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

An interesting target for the intruders is computers, since valuable data are fed into it. The need for impeccable intrusion detection system is growing every day. Hardware based Network Intrusion Detection System (NIDS) relies upon power, delay and area. The Counting Bloom filter (CBF), improves the power and speed of membership test by maintaining a hazy and compact representation of large set to be searched. Our proposed architecture utilizes an array of Linear Feedback Shift Register (LFSR) along with tri-state buffers. Circuit simulation is shown for 8-bit count per entry. Simulation results show that proposed architecture is 35% hardware efficient compared to Low Power Fast Counting Bloom Filter (L-CBF) and Static Random Access Memory based Counting Bloom Filter (S-CBF).

References
  1. www. netsecurity. about. com/cs/hackertools/a/aa030504. h.
  2. Boyer R. S. , & Moore J. S. (1977). A fast string searching algorithm. Communications of the ACM, 20, 762–772.
  3. Anagnostakis, K. G. , Antonatos, S. , Markatos, E. P. , & Polychronakis, M. (2003). E2xb: A domain specific string matching algorithm for intrusion detection. In Proceedings of the 18th IFIP international security conference(SEC2003).
  4. Aho, V. A. , & Corasick, M. J. (1975). Efficient string matching:An aid to bibliographic search. Communications of the ACM, 18, 333–340.
  5. Fisk, M. , & Varghese, G. (2002). An analysis of fast string matching applied to content-based forwarding and intrusion detection. In Technical report CS2001-0670 (updated version). San Diego: University of California.
  6. Norton, M. , & Roelker, D. (2002). Snort 2. 0: Detectionrevised. http://www. sourcefire. com/.
  7. Fisk, M. , & Varghese, G. (2004). Applying fast string matching to intrusion detection. Technical Report CS2001-0670,UCSD.
  8. B. Bloom, "Space/ time trade-offs in hash coding with allowable errors," Commun. ACM, vol. 13, no. 7, pp. 422-426, July 1970.
  9. Elham Sa?, Elham Sa?, Andreas Veneris,"L-CBF,A Low-Power,Fast Counting Bloom Filter Architecture" in IEEE Trans. On Very Large Scale Integration (VLSI) systems, Vol. 16, no. 6, June 2008,pp. 628-638.
  10. J. K. Peir, S. C. Lai, S. L. Lu, J. Stark, and K. Lai, "Bloom ?ltering cache misses for accurate data speculation and prefetching," in Proc. Ann. Int. Conf. Supercomput. , Jun. 2002, pp. 189–198.
  11. M. Mitzenmacher and S. Vadhan, "Why simple hash functions work: exploiting the entropy in a data stream," in Proc. of the 19th annual ACM-SIAM SODA, 2008, pp. 746–755.
  12. M. R. Stan, "Synchronous up/down counter with clock period inde- pendent of counter size," in Proc. Ann. Symp. Comput. Arithmetic, Jul. 1997, pp. 274–281.
  13. B. S. Amrutur and M. A. Horowitz, "Fast low-power decoders for RAMs," IEEE J. Solid-State Circuits, vol. 36, no. 10, pp. 1506–1515, Oct. 2001.
  14. B. S. Amrutur, "Design and analysis of fast low power SRAMs," Ph. D. dissertation, Elect. Eng. Dept. , Stanford Univ. , Stanford, CA, 1999.
  15. B. S. Amrutur and M. A. Horowitz, "Speed and power scaling of SRAM's," IEEE J. Solid-State Circuits, vol. 35, no. 2, pp. 175–185, Feb. 2000.
  16. M. Margala, "Low-power SRAM circuit design," in Proc. IEEE Work- shop Memory Technol. , Design Test. , Aug. 1999, pp. 115–122.
  17. P. Alfke, "Ef?cient shift registers, LFSR counters, and long pseudo- random sequence generators," Xilinx, San Jose, CA, Appl. Note 052, Jul. 1996.
  18. P. H. Bardell, W. H. McAnney, and J. Savir, Built-in test for VLSI: Pseudorandom techniques. New York: Wiley, 1987.
  19. M. R. Stan, A. F. Tenca, and M. D. Ercegovac, "Long and fast up/down counters," IEEE Trans. Comput. , vol. 47, no. 7, pp. 722–735, Jul. 1998.
  20. H. E. W. Neil and D. Harris, Principles of CMOS VLSI Design, 3rd ed. Reading, MA: Addison Wesley, 2004.
Index Terms

Computer Science
Information Sciences

Keywords

Counting Bloom Filters Area efficient counting bloom filter (A-CBF) Intrusion Detection System Linear Feedback Shift Register Tristate buffer

Powered by PhDFocusTM