DocumentCode :
2899348
Title :
High performance DFA-based string matching
Author :
Kim, Junghak
Author_Institution :
Wireless Syst. Res. Dept., Electron. & Telecommun. Res. Inst., Daejeon, South Korea
fYear :
2010
fDate :
27-30 Sept. 2010
Firstpage :
1
Lastpage :
6
Abstract :
On communication networks, deep-packet inspection (DPI) techniques are used to handle various requirements, such as network security, network quality-of-service and so on. DPI is a technique to scan packets to detect specific patterns from those packets and to identify those packets according to the scanning result and the purpose of requirements. String matching is a key element of DPI and is especially used for scanning application specific data of packet payload. In this paper, I propose a string matching architecture to process multiple characters at a single cycle and a technique to speed up the string matching process. The evaluation results show that the memory efficiency and the processing speed can be enhanced by the proposed approach, compared to the previous works.
Keywords :
finite automata; quality of service; security of data; string matching; telecommunication security; DFA-based string matching; communication networks; deep-packet inspection techniques; finite automata; memory efficiency; network quality-of-service; network security; packet payload; Doped fiber amplifiers; Field programmable gate arrays; Indexes; Logic gates; Memory management; Random access memory; Table lookup; TCAM; deep-packet inspection; finite automata; string matching;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Telecommunications Network Strategy and Planning Symposium (NETWORKS), 2010 14th International
Conference_Location :
Warsaw
Print_ISBN :
978-1-4244-6704-4
Electronic_ISBN :
978-1-4244-6705-1
Type :
conf
DOI :
10.1109/NETWKS.2010.5624960
Filename :
5624960
Link To Document :
بازگشت