By Topic

High performance DFA-based string matching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Junghak Kim ; Wireless Syst. Res. Dept., Electron. & Telecommun. Res. Inst., Daejeon, South Korea

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.

Published in:

Telecommunications Network Strategy and Planning Symposium (NETWORKS), 2010 14th International

Date of Conference:

27-30 Sept. 2010