Cargando…
A Memory-Efficient Deterministic Finite Automaton-Based Bit-Split String Matching Scheme Using Pattern Uniqueness in Deep Packet Inspection
This paper proposes a memory-efficient bit-split string matching scheme for deep packet inspection (DPI). When the number of target patterns becomes large, the memory requirements of the string matching engine become a critical issue. The proposed string matching scheme reduces the memory requiremen...
Autores principales: | Kim, HyunJin, Choi, Kang-Il, Choi, Sang-Il |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4418843/ https://www.ncbi.nlm.nih.gov/pubmed/25938779 http://dx.doi.org/10.1371/journal.pone.0126517 |
Ejemplares similares
-
A Pipelined Non-Deterministic Finite Automaton-Based String Matching Scheme Using Merged State Transitions in an FPGA
por: Kim, HyunJin, et al.
Publicado: (2016) -
A Hybrid CPU/GPU Pattern-Matching Algorithm for Deep Packet Inspection
por: Lee, Chun-Liang, et al.
Publicado: (2015) -
A parameter-free learning automaton scheme
por: Ren, Xudie, et al.
Publicado: (2022) -
Bit-string physics: a finite and discrete approach to natural philosophy
por: Noyes, H Pierre, et al.
Publicado: (2001) -
Dirac Cellular Automaton from Split-step Quantum Walk
por: Mallick, Arindam, et al.
Publicado: (2016)