.png){kind=icon}
Return
Processor array architectures for deep packet classification
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2006.39.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a systematic technique for expressing a string search algorithm as a regular iterative expression to explore all possible processor arrays for deep packet classification. The computation domain of the algorithm is obtained and three affine scheduling functions are presented. The technique allows some of the algorithm variables to be pipelined while others are broadcast over system-wide buses. Nine possible processor array structures are obtained and analyzed in terms of speed, area, power, and I/O timing requirements. Time complexities are derived analytically and through extensive numerical simulations. The proposed designs exhibit optimum speed and area complexities. The processor arrays are compared with previously derived processor arrays for the string matching problem.
Keywords:
processor array
string search
deep packet classification
parallel hardware
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
No organization information available
Cited Papers
ShareSaveParametric subtracted post‐ictal diffusion tensor imaging for guiding direct neurostimulation therapy.png)
Hippocampus
HippocampusIF0
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more