ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

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

상세정보

학술지 A Memory-Efficient Two-Stage String Matching Engine Using both Content-Addressable Memory and Bit-split String Matchers for Deep Packet Inspection
Cited - time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
김현진, 최강일
발행일
201407
출처
한국통신학회논문지, v.39B no.7, pp.433-439
ISSN
1226-4717
출판사
한국통신학회 (KICS)
DOI
https://dx.doi.org/10.7840/kics.2014.39B.7.433
협약과제
14MI9200, (통합)스마트 네트워킹 핵심 기술 개발, 이병선
초록
This paper proposes an architecture of two-stage string matching engine with content-addressablememory(CAM) and parallel bit-split string matchers for deep packet inspection(DPI). Each long signature isdivided into subpatterns with the same length, where subpatterns are mapped onto the CAM in the first stage.The long pattern is matched in the second stage using the sequence of the matching indexes from the CAM. Byadopting CAM and bit-split string matchers, the memory requirements can be greatly reduced in theheterogeneous string matching environments.
KSP 제안 키워드
Bit-split, Content-addressable memory(CAM), First stage, Matching engine, Two-Stage, deep packet inspection(DPI), memory requirements, memory-efficient, string matching