ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Journal Article A Hardware-Based String Matching Using State Transition Compression for Deep Packet Inspection
Cited 8 time in scopus Download 2 time Share share facebook twitter linkedin kakaostory
Authors
김현진, Lee Seung-Woo
Issue Date
201302
Source
ETRI Journal, v.35 no.1, pp.154-157
ISSN
1225-6463
Publisher
한국전자통신연구원 (ETRI)
DOI
https://dx.doi.org/10.4218/etrij.13.0212.0165
Project Code
12PI2900, Computing-Embedded Media Integrated Delivery System which supporting High Definition Media Services, Soon Seok Lee
Abstract
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 Keywords
Compressed state, Matching engine, Memory size, Memory-based, Parallel string matching, State Transition, Transition Compression, deep packet inspection(DPI), finite state machine