2016
DOI: 10.1109/tnet.2015.2429918
|View full text |Cite
|
Sign up to set email alerts
|

Scalable Algorithms for NFA Multi-Striding and NFA-Based Deep Packet Inspection on GPUs

Abstract: Finite state automata (FSA) are used by many network processing applications to match complex sets of regular expressions in network packets. In order to make FSA-based matching possible even at the ever-increasing speed of modern networks, multi-striding has been introduced. This technique increases input parallelism by transforming the classical FSA that consumes input byte by byte into an equivalent one that consumes input in larger units. However, the algorithms used today for this transformation are so co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
7
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(11 citation statements)
references
References 18 publications
1
7
0
Order By: Relevance
“…The finding of this study shows that sleepiness is a precipitating factor for injuries among the EMS workers. This finding is in agreement with the existing literature which demonstrates 3 Respondents take a 48-hour shift and have 24 hours off with two extra days off per month. 4 Respondents take a 48-hour shift and have 24 hours off with one extra day off per month.…”
Section: Injurysupporting
confidence: 93%
See 1 more Smart Citation
“…The finding of this study shows that sleepiness is a precipitating factor for injuries among the EMS workers. This finding is in agreement with the existing literature which demonstrates 3 Respondents take a 48-hour shift and have 24 hours off with two extra days off per month. 4 Respondents take a 48-hour shift and have 24 hours off with one extra day off per month.…”
Section: Injurysupporting
confidence: 93%
“…Sleepiness refers to a strong desire to fall asleep [3]. To show the seriousness of the sleepiness in the EMS department, it is worthy to put some statistics into perspective.…”
Section: Introductionmentioning
confidence: 99%
“…To increase the processing rate in regex/automata processing, a number of multi-stride (processing mutiple symbols per cycle) automata processing engines have been proposed on CPUs/GPUs [2,12,19,42,49] and FPGAs [21,42,52,53]. Yang et al [53] proposed a multi-symbol processing for regular expressions on FPGA and utilized both LUTs and BRAMs.…”
Section: Prior Workmentioning
confidence: 99%
“…However, this can be extremely inefficient, especially when the application alphabet (symbol-set) size is very small, and the number of rows in a subarray is more than required. For example, in genomics, the alphabets are A,T , C, and G, and a 2-bit automata organization with only 2 2 rows is enough to perform the string matching. This is 64× smaller than what existing spatial architectures provide!…”
Section: Introductionmentioning
confidence: 99%
“…To reduce cost of memory accesses, input symbols were loaded to shared memory [7,55], input data layout was changed [55] to avoid uncoalesced accesses, or vector loads were used [49]. Others used k-stride NFAs [8], which consume k bytes at a time, but can blow up the alphabet to |Σ| k . Some implementations place state transition tables in texture memory [49] or on-chip constant memory [7].…”
Section: Related Workmentioning
confidence: 99%