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

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 357
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorOh, HSko
dc.contributor.authorKyung, Chong-Minko
dc.date.accessioned2013-03-03T22:48:21Z-
dc.date.available2013-03-03T22:48:21Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2004-08-
dc.identifier.citationELECTRONICS LETTERS, v.40, pp.1041 - 1043-
dc.identifier.issn0013-5194-
dc.identifier.urihttp://hdl.handle.net/10203/80789-
dc.description.abstractA 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.-
dc.languageEnglish-
dc.publisherINST ENGINEERING TECHNOLOGY-IET-
dc.titleMemory reduction by intermediate result value encoding for content-based classification-
dc.typeArticle-
dc.identifier.wosid000223623900008-
dc.identifier.scopusid2-s2.0-4444283802-
dc.type.rimsART-
dc.citation.volume40-
dc.citation.beginningpage1041-
dc.citation.endingpage1043-
dc.citation.publicationnameELECTRONICS LETTERS-
dc.identifier.doi10.1049/el:20045115-
dc.contributor.localauthorKyung, Chong-Min-
dc.contributor.nonIdAuthorOh, HS-
dc.type.journalArticleArticle-
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0