arrow
Return

A software-based string matching algorithm for resource-restricted network system

delete2008-08-01
delete1
PRE
AI
Y
Yen-Ming Chu *
N
Nen‐Fu Huang
C
Chi‐Hung Tsai
C
Chen-Ying Hsieh
DOI:10.1109/LCOMM.2008.080253delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
String matching is the most critical operation in network intrusion detection Systems (NIDS) [1]. This paper proposes a novel memory-efficient string matching algorithm that only requires around 2% of the memory utilized in Aho-Corasick algorithm [2] but has more than 4 times the throughput of state-of-the-art algorithm with very limited memory resource. The proposed algorithm is flexible to fit different resource constraints and performance requirements.
Keywords:
embedded system security
computer network security
network intrusion detection
string matching

Journal

IEEE Communications Letters cover
IEEE Communications Letters
IF:
4.4
Papers:
1.3W
Citations:
2.2W

Organization

N
National Tsing Hua University
Scholars:
1.6W
Papers: 1.4W
Citations: 1.7W
Cited Papers

Cited Papers

errShare
errSave