2012
DOI: 10.1007/s11633-012-0660-2
|View full text |Cite
|
Sign up to set email alerts
|

Functional verification of signature detection architectures for high speed network applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…In future, ALG reversible gate will be validated as a basic building logic of a reversible logic circuit. Due to its technology limitations, presently, traditional computing evolves by improving the parallelism [33] [34]. In future, certain emerging computing like optical, quantum, bio- Table 2 Validation of ALG reversible gate inspired computing will adopt reversible logic.…”
Section: Resultsmentioning
confidence: 99%
“…In future, ALG reversible gate will be validated as a basic building logic of a reversible logic circuit. Due to its technology limitations, presently, traditional computing evolves by improving the parallelism [33] [34]. In future, certain emerging computing like optical, quantum, bio- Table 2 Validation of ALG reversible gate inspired computing will adopt reversible logic.…”
Section: Resultsmentioning
confidence: 99%
“…However, this algorithm is only suitable for finding the small character sets pattern string in large character set text string. 6. Other Research Directions [15][16][17][18][19][20] In addition, some researchers improve the NIDS by adapting different methods. For instance, Sravani.K [15] proposed the use of a classification algorithm for network traffic data classification.…”
Section: Background and Problem Statementsmentioning
confidence: 99%
“…For instance, Sravani.K [15] proposed the use of a classification algorithm for network traffic data classification. M.Arun [16] discussed the signature detection technique (SDT) used in NIDS, whose approach involves a unique combination of algorithmic and architectural techniques that outperform some of the previous techniques in terms of performance, speed and power-efficiency. Zhicai Shi [20] proposed a simple and fast discretization algorithm based on information loss by fusing Rough Set theory with Entropy theory.…”
Section: Background and Problem Statementsmentioning
confidence: 99%
“…For example, Songtan [8] presents an improved multi-pattern matching algorithm which is based on deterministic finite-state automaton. However, this algorithm is only suitable for finding the small character sets pattern string in large character set text string. 5) Rule list [13][14][15][16] As Samaneh Rastegari [13] indicated, because the tree structure of rule list is simple, there exist problems of oversize RTN rule list and overlength average match length in the rule list of NIDS. This fact will result in increased resource consumption and overload at NIDS.…”
Section: Introductionmentioning
confidence: 99%