ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 High Performance DFA-based String Matching
Cited 0 time in scopus Download 2 time Share share facebook twitter linkedin kakaostory
저자
김정학
발행일
201009
출처
International Telecommunications Network Strategy and Planning Symposium (Networks) 2010, pp.1-6
DOI
https://dx.doi.org/10.1109/NETWKS.2010.5624960
협약과제
10MI2300, WiBro 네트워크 신뢰성 확보 및 위치 인지 기술 개발, 안지환
초록
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. ©2010 IEEE.
KSP 제안 키워드
Application-specific, High performance, Key element, Matching Process, Memory Efficiency, Packet payload, Processing speed, Single cycle, Speed-up, communication network, deep packet inspection(DPI)