Full metadata record
DC FieldValueLanguage
dc.contributor.authorTseng, Kuo-Kunen_US
dc.contributor.authorLai, Yuan-Chengen_US
dc.contributor.authorLin, Ying-Daren_US
dc.contributor.authorLee, Tsern-Hueien_US
dc.date.accessioned2014-12-08T15:09:44Z-
dc.date.available2014-12-08T15:09:44Z-
dc.date.issued2009-04-01en_US
dc.identifier.issn1539-9087en_US
dc.identifier.urihttp://dx.doi.org/10.1145/1509288.1509291en_US
dc.identifier.urihttp://hdl.handle.net/11536/7440-
dc.description.abstractHome and office network gateways often employ a cost-effective embedded network processor to handle their network services. Such network gateways have received strong demand for applications dealing with intrusion detection, keyword blocking, antivirus and antispam. Accordingly, we were motivated to propose an appropriate fast scalable automaton-matching (FSAM) hardware to accelerate the embedded network processors. Although automaton matching algorithms are robust with deterministic matching time, there is still plenty of room for improving their average-case performance. FSAM employs novel prehash and root-index techniques to accelerate the matching for the nonroot states and the root state, respectively, in automation based hardware. The prehash approach uses some hashing functions to pretest the input sub-string for the nonroot states while the root-index approach handles multiple bytes in one single matching for the root state. Also, FSAM is applied in a prevalent automaton algorithm, Aho-Corasick (AC), which is often used in many content-filtering applications. When implemented in FPGA, FSAM can perform at the rate of 11.1Gbps with the pattern set of 32,634 bytes, demonstrating that our proposed approach can use a small logic circuit to achieve a competitive performance, although a larger memory is used. Furthermore, the amount of patterns in FSAM is not limited by the amount of internal circuits and memories. If the high-speed external memories are employed, FSAM can support up to 21,302 patterns while maintaining similar high performance.en_US
dc.language.isoen_USen_US
dc.subjectAlgorithmsen_US
dc.subjectPerformanceen_US
dc.subjectDesignen_US
dc.subjectString matchingen_US
dc.subjectcontent filteringen_US
dc.subjectautomatonen_US
dc.subjectAho-Corasicken_US
dc.subjectBloom filteren_US
dc.titleA Fast Scalable Automaton-Matching Accelerator for Embedded Content Processorsen_US
dc.typeArticleen_US
dc.identifier.doi10.1145/1509288.1509291en_US
dc.identifier.journalACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMSen_US
dc.citation.volume8en_US
dc.citation.issue3en_US
dc.citation.epageen_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.department電信工程研究所zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.contributor.departmentInstitute of Communications Engineeringen_US
dc.identifier.wosnumberWOS:000266818500003-
dc.citation.woscount2-
Appears in Collections:Articles


Files in This Item:

  1. 000266818500003.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.