DocumentCode
1082600
Title
Memory reduction by intermediate result value encoding for content-based classification
Author
Oh, H.-S. ; Kyung, C.M.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., KAIST, Daejeon, South Korea
Volume
40
Issue
17
fYear
2004
Firstpage
1041
Lastpage
1043
Abstract
A method for content-based classification using results from a string search and a layer 3-4 lookup is proposed. Encoding of the intermediate result value enables wire-speed processing while reducing the memory by over 70% compared to the dependent search scheme. Rule partitioning by range types helps to encode ranges within a minute for an intrusion-detection rule set having about 1000 rules.
Keywords
content-addressable storage; encoding; knowledge based systems; logic partitioning; packet switching; pattern classification; table lookup; content-based classification; intermediate result value encoding; intrusion-detection rule; layer 3-A lookup; memory reduction; rule partitioning; string search; wire-speed processing;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:20045115
Filename
1327511
Link To Document