상세정보
학술지
A Hardware-Based String Matching Using State Transition Compression for Deep Packet Inspection
- 저자
- 김현진, 이승우
- 발행일
- 201302
- 출처
- ETRI Journal, v.35 no.1, pp.154-157
- ISSN
- 1225-6463
- 출판사
- 한국전자통신연구원 (ETRI)
- 협약과제
- 12PI2900, 고화질 영상 서비스 지원을 위한 컴퓨팅 내재형 미디어 융합 전달 시스템 기술개발, 이순석
- 초록
- This letter proposes a memory-based parallel string matching engine using the compressed state transitions. In the finite-state machines of each string matcher, the pointers for representing the existence of state transitions are compressed. In addition, the bit fields for storing state transitions can be shared. Therefore, the total memory requirement can be minimized by reducing the memory size for storing state transitions. © 2013 ETRI.
- KSP 제안 키워드
- Compressed state, Matching engine, Memory size, Memory-based, Parallel string matching, State Transition, Transition Compression, deep packet inspection(DPI), finite state machine