SoC implementation of network intrusion detection using counting bloom filter

Meghana, V; Suresh, Manasa; Sandhya, S; Aparna, R.; Gururaj, C.

doi:10.1109/rteict.2016.7808154

Cited by 4 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…String matching algorithms tries to find the position where patterns are found within a larger string or text [855]. For FPGAs we found string matching implementations for network intrussion detection [856][857][858], deep packet inspection [859] and string matching algorithms based in bloom filter [860,861]. Fixed-point arithmetic algorithms have been used in FPGA for accuracy-guaranteed bit-width optimization [862,863], Jacobi SVD (Singular Value Decomposition) [864], Lanczos tridiagonalization [865,866] and deep belief networks [867,868].…”

Section: Computer Algorithmsmentioning

confidence: 99%

Field Programmable Gate Array Applications—A Scientometric Review

2019

View full text Add to dashboard Cite

Field Programmable Gate Array (FPGA) is a general purpose programmable logic device that can be configured by a customer after manufacturing to perform from a simple logic gate operations to complex systems on chip or even artificial intelligence systems. Scientific publications related to FPGA started in 1992 and, up to now, we found more than 70,000 documents in the two leading scientific databases (Scopus and Clarivative Web of Science). These publications show the vast range of applications based on FPGAs, from the new mechanism that enables the magnetic suspension system for the kilogram redefinition, to the Mars rovers’ navigation systems. This paper reviews the top FPGAs’ applications by a scientometric analysis in ScientoPy, covering publications related to FPGAs from 1992 to 2018. Here we found the top 150 applications that we divided into the following categories: digital control, communication interfaces, networking, computer security, cryptography techniques, machine learning, digital signal processing, image and video processing, big data, computer algorithms and other applications. Also, we present an evolution and trend analysis of the related applications.

show abstract

Section: Computer Algorithmsmentioning

confidence: 99%

Field Programmable Gate Array Applications—A Scientometric Review

2019

View full text Add to dashboard Cite

show abstract

“…There is a compromise between efficiency and accuracy. A Bloom filter (BF) [3] and its variants [4,5], as a type of space-efficient and constant query delay random data structure, have been applied to represent a big set and retrieve memberships broadly [4,5], including IP address lookup [6,7], routing-table lookup [8], hardware String Matching [9,10], cooperative Web caching [11], intrusion detection [12][13][14][15], and so on.…”

Section: Introductionmentioning

confidence: 99%

A Bloom Filter for High Dimensional Vectors

et al. 2018

View full text Add to dashboard Cite

Regardless of the type of data, traditional Bloom filters treat each element of a set as a string, and by iterating every character of the string, they discretize all data randomly and uniformly. However, with the data size and dimension increases, these variants are inefficient. To better discretize vectors with high numerical dimensions, this paper improves the string hashes to integer hashes. Based on the integer hashes and a counter array, we propose a new variant-high-dimensional Bloom filter (HDBF)-to extend the Bloom filter into high-dimensional spaces, which can represent and query numerical vectors of a big set with a low false positive probability. This paper theoretically analyzes the feasibility of the integer hashes on discretizing data and discusses the relationship of parameters of the HDBF. The experiments illustrate that, in high-dimensional numerical spaces, the HDBF shows better randomness on distribution and entropy than that of the counting Bloom filter. Compared with the parallel Bloom filters, for a fixed false positive probability, the HDBF displays time-space overheads, and is more suitable to deal with the numerical vectors with high dimensions.

show abstract

FPGA-Based Memory Efficient Shift-And Algorithm for Regular Expression Matching

Kim

Park

2018

Applied Reconfigurable Computing. Architectures, Tools, and Applications

View full text Add to dashboard Cite

SoC implementation of network intrusion detection using counting bloom filter

Cited by 4 publications

References 7 publications

Field Programmable Gate Array Applications—A Scientometric Review

Field Programmable Gate Array Applications—A Scientometric Review

A Bloom Filter for High Dimensional Vectors

FPGA-Based Memory Efficient Shift-And Algorithm for Regular Expression Matching

Contact Info

Product

Resources

About