Memory reduction by intermediate result value encoding for content-based classification

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 hel...

Full description

Saved in:
Bibliographic Details
Published inElectronics letters Vol. 40; no. 17; p. 1
Main Authors Oh, H-S, Kyung, C-M
Format Journal Article
LanguageEnglish
Published Stevenage John Wiley & Sons, Inc 19.08.2004
Subjects
Classification
Encoding
Partitioning
Reduction
Searching
Strings
Online AccessGet full text

Cover

More Information
Summary: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 1,000 rules.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0013-5194
1350-911X