A hybrid multiple-character transition finite-automaton for string matching engine
[Display omitted] •A hybrid finite automaton is proposed with deterministic and nondeterministic parts.•The hybrid FA is capable of inspecting multiple characters in parallel.•The space required by the finite automata is efficient when scales up.•The transitions number increases almost linearly to t...
Gespeichert in:
| Veröffentlicht in: | Microprocessors and microsystems Jg. 39; H. 2; S. 122 - 134 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.03.2015
|
| Schlagworte: | |
| ISSN: | 0141-9331, 1872-9436 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | [Display omitted]
•A hybrid finite automaton is proposed with deterministic and nondeterministic parts.•The hybrid FA is capable of inspecting multiple characters in parallel.•The space required by the finite automata is efficient when scales up.•The transitions number increases almost linearly to the number of multi-character.•A configurable multi-stage architecture can implement the hybrid finite automaton.
The throughput of a string-matching engine can be multiplied up by inspecting multiple characters in parallel. However, the space that is required to implement a matching engine that can process multiple characters in every cycle grows dramatically with the number of characters to be processed in parallel. This paper presents a hybrid finite automaton (FA) that has deterministic and nondeterministic finite automaton (NFA and DFA) parts and is based on the Aho-Corasick algorithm, for inspecting multiple characters in parallel while maintaining favorable space utilization. In the presented approach, the number of multi-character transitions increases almost linearly with respect to the number of characters to be inspected in parallel. This paper also proposes a multi-stage architecture for implementing the hybrid FA. Since this multi-stage architecture has deterministic stages, configurable features can be introduced into it for processing various keyword sets by simply updating the configuration. The experimental results of the implementation of the multi-stage architecture on FPGAs for 8-character transitions reveal a 4.3 Gbps throughput with a 67MHz clock, and the results obtained when the configurable architecture with two-stage pipelines was implemented in ASICs reveal a 7.9 Gbps throughput with a 123MHz clock. |
|---|---|
| AbstractList | [Display omitted]
•A hybrid finite automaton is proposed with deterministic and nondeterministic parts.•The hybrid FA is capable of inspecting multiple characters in parallel.•The space required by the finite automata is efficient when scales up.•The transitions number increases almost linearly to the number of multi-character.•A configurable multi-stage architecture can implement the hybrid finite automaton.
The throughput of a string-matching engine can be multiplied up by inspecting multiple characters in parallel. However, the space that is required to implement a matching engine that can process multiple characters in every cycle grows dramatically with the number of characters to be processed in parallel. This paper presents a hybrid finite automaton (FA) that has deterministic and nondeterministic finite automaton (NFA and DFA) parts and is based on the Aho-Corasick algorithm, for inspecting multiple characters in parallel while maintaining favorable space utilization. In the presented approach, the number of multi-character transitions increases almost linearly with respect to the number of characters to be inspected in parallel. This paper also proposes a multi-stage architecture for implementing the hybrid FA. Since this multi-stage architecture has deterministic stages, configurable features can be introduced into it for processing various keyword sets by simply updating the configuration. The experimental results of the implementation of the multi-stage architecture on FPGAs for 8-character transitions reveal a 4.3 Gbps throughput with a 67MHz clock, and the results obtained when the configurable architecture with two-stage pipelines was implemented in ASICs reveal a 7.9 Gbps throughput with a 123MHz clock. The throughput of a string-matching engine can be multiplied up by inspecting multiple characters in parallel. However, the space that is required to implement a matching engine that can process multiple characters in every cycle grows dramatically with the number of characters to be processed in parallel. This paper presents a hybrid finite automaton (FA) that has deterministic and nondeterministic finite automaton (NFA and DFA) parts and is based on the Aho-Corasick algorithm, for inspecting multiple characters in parallel while maintaining favorable space utilization. In the presented approach, the number of multi-character transitions increases almost linearly with respect to the number of characters to be inspected in parallel. This paper also proposes a multi-stage architecture for implementing the hybrid FA. Since this multi-stage architecture has deterministic stages, configurable features can be introduced into it for processing various keyword sets by simply updating the configuration. The experimental results of the implementation of the multi-stage architecture on FPGAs for 8-character transitions reveal a 4.3 Gbps throughput with a 67MHz clock, and the results obtained when the configurable architecture with two-stage pipelines was implemented in ASICs reveal a 7.9 Gbps throughput with a 123MHz clock. |
| Author | Chen, Chien-Chi Wang, Sheng-De |
| Author_xml | – sequence: 1 givenname: Chien-Chi surname: Chen fullname: Chen, Chien-Chi – sequence: 2 givenname: Sheng-De surname: Wang fullname: Wang, Sheng-De email: sdwang@ntu.edu.tw |
| BookMark | eNqFkE9LxDAQxYOs4K76DTz06KV10mzT1oMgi_9AEETPIU2m7ixtuiZZYb-9LevJg57m8XjvwfwWbOYGh4xdcMg4cHm1yXoyWz9kOfAiA54BiCM251WZp_VSyBmbA1_ytBaCn7BFCBsAKEDmc_Z6m6z3jSeb9Lsu0rbD1Ky11yaiT6LXLlCkwSUtOYqY6l0ceh0nY_BJiJ7cRzIaZj0JdB_k8Iwdt7oLeP5zT9n7_d3b6jF9fnl4Wt0-p0aIOqYVtxptK2ozCotNbktoNQJWvLQIbWNsjVg1Usiy1pUEborCFlo2WpRGG3HKLg-74-efOwxR9RQMdp12OOyC4mUJeSWXuRyjy0PU-CEEj63aeuq13ysOakKoNuqAUE0IFXA1Ihxr179qhqKeeIxkqPuvfHMo48jgi9CrYAidQUseTVR2oL8HvgE0S5SL |
| CitedBy_id | crossref_primary_10_1109_TVLSI_2017_2753843 crossref_primary_10_1016_j_compeleceng_2021_107169 |
| Cites_doi | 10.1016/j.micpro.2012.05.009 10.1093/comjnl/bxs093 10.1145/360825.360855 10.1145/1364654.1364656 10.1109/FPL.2008.4629920 10.1145/1839667.1839672 10.1109/INFCOM.2004.1354682 10.1007/s11416-006-0010-4 10.1109/ISCC.2008.4625587 10.1109/FCCM.2004.50 10.1109/ICNP.2006.320212 10.1109/ICPADS.2008.47 10.1109/ICSAMOS.2007.4285750 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier B.V. |
| Copyright_xml | – notice: 2015 Elsevier B.V. |
| DBID | AAYXX CITATION 7SC 7SP 8FD F28 FR3 JQ2 L7M L~C L~D |
| DOI | 10.1016/j.micpro.2015.01.003 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Architecture |
| EISSN | 1872-9436 |
| EndPage | 134 |
| ExternalDocumentID | 10_1016_j_micpro_2015_01_003 S0141933115000046 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1~. 1~5 29M 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFS ACIWK ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W JJJVA KOM LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K T9H TN5 UHS WUQ XOL XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 7SP 8FD F28 FR3 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c339t-81daedf39c1dadeb2d70fae0e817de0fbcd9ee8b63679a8601c55d5a6ba37cac3 |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000352173800007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0141-9331 |
| IngestDate | Wed Oct 01 14:03:15 EDT 2025 Tue Nov 18 22:29:11 EST 2025 Sat Nov 29 07:53:52 EST 2025 Fri Feb 23 02:26:32 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Aho-Corasick algorithm Deterministic and nondeterministic finite automaton Network intrusion detection system String matching |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c339t-81daedf39c1dadeb2d70fae0e817de0fbcd9ee8b63679a8601c55d5a6ba37cac3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1770286426 |
| PQPubID | 23500 |
| PageCount | 13 |
| ParticipantIDs | proquest_miscellaneous_1770286426 crossref_primary_10_1016_j_micpro_2015_01_003 crossref_citationtrail_10_1016_j_micpro_2015_01_003 elsevier_sciencedirect_doi_10_1016_j_micpro_2015_01_003 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-03-01 |
| PublicationDateYYYYMMDD | 2015-03-01 |
| PublicationDate_xml | – month: 03 year: 2015 text: 2015-03-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Microprocessors and microsystems |
| PublicationYear | 2015 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Aho, Corasick (b0005) 1975; 18 Tripp (b0075) 2006; 2 Soewito (b0100) 2013; 4 Chen, Wang (b0035) 2013; 10 M. Becchi, P. Crowley, A hybrid finite automaton for practical deep packet inspection, in: Proceedings of the 2007 ACM CoNEXT Conference, CoNEXT ’07, ACM, 2007, pp. 1:1–1:12. X. Zha, S. Sahni, Highly compressed Aho-Corasick automata for efficient intrusion detection, in: IEEE Symposium on Computers and Communications, 2008, ISCC 2008, 2008, pp. 298–303. . Nakahara, Sasao, Matsuura (b0010) 2012; 36 Chen, Wang (b0030) 2012; 8 N. Yamagaki, R. Sidhu, S. Kamiya, High-speed regular expression matching engine using multi-character NFA, in: International Conference on Field Programmable Logic and Applications, 2008, FPL 2008, 2008, pp. 131–136. C. Clark, D. Schimmel, Scalable pattern matching for high speed networks, in: 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 2004, FCCM 2004, 2004, pp. 249–257. N. Tuck, T. Sherwood, B. Calder, G. Varghese, Deterministic memory-efficient string matching algorithms for intrusion detection, in: INFOCOM 2004, Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, vol. 4, 2004, pp. 2628–2639. V. Dimopoulos, I. Papaefstathiou, D. Pnevmatikatos, A memory-efficient reconfigurable Aho-Corasick FSM implementation for intrusion detection systems, in: International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation, 2007. IC-SAMOS 2007, 2007, pp. 186–193. Sugawara, Inaba, Hiraki (b0070) 2004; vol. 3203 M. Alicherry, M. Muthuprasanna, V. Kumar, High speed pattern matching for network IDS/IPS, in: Proceedings of the 2006 14th IEEE International Conference on Network Protocols, 2006, ICNP ’06, 2006, pp. 187–196. Pao, Lin, Liu (b0050) 2010; 7 Rahmanzadeh, Ghaznavi-Ghoushchi (b0080) 2009; vol. 6 Scarpazza, Villa, Petrini (b0105) 2008 Pao, Wang (b0025) 2012; 55 Snort. W. Lin, B. Liu, Pipelined parallel ac-based approach for multi-string matching, in: 14th IEEE International Conference on Parallel and Distributed Systems, 2008. ICPADS ’08, 2008, pp. 665–672. Hua, Song, Lakshman (b0020) 2009 Pao (10.1016/j.micpro.2015.01.003_b0025) 2012; 55 Aho (10.1016/j.micpro.2015.01.003_b0005) 1975; 18 Soewito (10.1016/j.micpro.2015.01.003_b0100) 2013; 4 10.1016/j.micpro.2015.01.003_b0060 Rahmanzadeh (10.1016/j.micpro.2015.01.003_b0080) 2009; vol. 6 Hua (10.1016/j.micpro.2015.01.003_b0020) 2009 Sugawara (10.1016/j.micpro.2015.01.003_b0070) 2004; vol. 3203 10.1016/j.micpro.2015.01.003_b0090 10.1016/j.micpro.2015.01.003_b0085 10.1016/j.micpro.2015.01.003_b0040 10.1016/j.micpro.2015.01.003_b0095 10.1016/j.micpro.2015.01.003_b0045 10.1016/j.micpro.2015.01.003_b0055 Chen (10.1016/j.micpro.2015.01.003_b0030) 2012; 8 10.1016/j.micpro.2015.01.003_b0065 Chen (10.1016/j.micpro.2015.01.003_b0035) 2013; 10 10.1016/j.micpro.2015.01.003_b0015 Pao (10.1016/j.micpro.2015.01.003_b0050) 2010; 7 Tripp (10.1016/j.micpro.2015.01.003_b0075) 2006; 2 Scarpazza (10.1016/j.micpro.2015.01.003_b0105) 2008 Nakahara (10.1016/j.micpro.2015.01.003_b0010) 2012; 36 |
| References_xml | – volume: 2 start-page: 21 year: 2006 end-page: 34 ident: b0075 article-title: A parallel string matching engine for use in high speed network intrusion detection systems publication-title: J. Comput. Virol. – reference: Snort. – reference: W. Lin, B. Liu, Pipelined parallel ac-based approach for multi-string matching, in: 14th IEEE International Conference on Parallel and Distributed Systems, 2008. ICPADS ’08, 2008, pp. 665–672. – volume: 55 start-page: 1216 year: 2012 end-page: 1231 ident: b0025 article-title: Multi-stride string searching for high-speed content inspection publication-title: Comput. J. – reference: V. Dimopoulos, I. Papaefstathiou, D. Pnevmatikatos, A memory-efficient reconfigurable Aho-Corasick FSM implementation for intrusion detection systems, in: International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation, 2007. IC-SAMOS 2007, 2007, pp. 186–193. – volume: 4 start-page: 57 year: 2013 end-page: 68 ident: b0100 article-title: Packet inspection on programmable hardware publication-title: Comput. Eng. Intell. Syst. – volume: 18 start-page: 333 year: 1975 end-page: 340 ident: b0005 article-title: Efficient string matching: an aid to bibliographic search publication-title: Commun. ACM – reference: . – volume: 7 start-page: 10:1 year: 2010 end-page: 10:27 ident: b0050 article-title: A memory-efficient pipelined implementation of the Aho-Corasick string-matching algorithm publication-title: ACM Trans. Archit. Code Optim. – volume: vol. 6 start-page: 847 year: 2009 end-page: 851 ident: b0080 article-title: A multi-gb/s parallel string matching engine for intrusion detection systems publication-title: Adv-ances in Computer Science and Engineering – volume: 36 start-page: 644 year: 2012 end-page: 664 ident: b0010 article-title: A regular expression matching circuit: decomposed non-deterministic realization with prefix sharing and multi-character transition publication-title: Microprocess. Microsyst. – reference: M. Alicherry, M. Muthuprasanna, V. Kumar, High speed pattern matching for network IDS/IPS, in: Proceedings of the 2006 14th IEEE International Conference on Network Protocols, 2006, ICNP ’06, 2006, pp. 187–196. – reference: N. Tuck, T. Sherwood, B. Calder, G. Varghese, Deterministic memory-efficient string matching algorithms for intrusion detection, in: INFOCOM 2004, Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, vol. 4, 2004, pp. 2628–2639. – volume: vol. 3203 start-page: 484 year: 2004 end-page: 493 ident: b0070 article-title: Over 10 publication-title: Field Programmable Logic and Application – volume: 10 start-page: 25 year: 2013 ident: b0035 article-title: An efficient multicharacter transition string-matching engine based on the Aho-Corasick algorithm publication-title: ACM Trans. Archit. Code Optim. (TACO) – reference: X. Zha, S. Sahni, Highly compressed Aho-Corasick automata for efficient intrusion detection, in: IEEE Symposium on Computers and Communications, 2008, ISCC 2008, 2008, pp. 298–303. – start-page: 415 year: 2009 end-page: 423 ident: b0020 article-title: Variable-stride multi-pattern matching for scalable deep packet inspection publication-title: INFOCOM 2009 – volume: 8 start-page: 8367 year: 2012 end-page: 8386 ident: b0030 article-title: A multi-character transition string matching architecture based on Aho-Corasick algorithm publication-title: Int. J. Innovat. Comput. Inform. Control (IJICIC) – reference: C. Clark, D. Schimmel, Scalable pattern matching for high speed networks, in: 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 2004, FCCM 2004, 2004, pp. 249–257. – start-page: 33 year: 2008 end-page: 42 ident: b0105 article-title: Exact multi-pattern string matching on the Cell/B.E. processor publication-title: Proceedings of the 5th Conference on Computing Frontiers – reference: M. Becchi, P. Crowley, A hybrid finite automaton for practical deep packet inspection, in: Proceedings of the 2007 ACM CoNEXT Conference, CoNEXT ’07, ACM, 2007, pp. 1:1–1:12. – reference: N. Yamagaki, R. Sidhu, S. Kamiya, High-speed regular expression matching engine using multi-character NFA, in: International Conference on Field Programmable Logic and Applications, 2008, FPL 2008, 2008, pp. 131–136. – volume: 36 start-page: 644 issue: 8 year: 2012 ident: 10.1016/j.micpro.2015.01.003_b0010 article-title: A regular expression matching circuit: decomposed non-deterministic realization with prefix sharing and multi-character transition publication-title: Microprocess. Microsyst. doi: 10.1016/j.micpro.2012.05.009 – volume: 55 start-page: 1216 issue: 10 year: 2012 ident: 10.1016/j.micpro.2015.01.003_b0025 article-title: Multi-stride string searching for high-speed content inspection publication-title: Comput. J. doi: 10.1093/comjnl/bxs093 – volume: 18 start-page: 333 issue: 6 year: 1975 ident: 10.1016/j.micpro.2015.01.003_b0005 article-title: Efficient string matching: an aid to bibliographic search publication-title: Commun. ACM doi: 10.1145/360825.360855 – ident: 10.1016/j.micpro.2015.01.003_b0065 doi: 10.1145/1364654.1364656 – ident: 10.1016/j.micpro.2015.01.003_b0085 doi: 10.1109/FPL.2008.4629920 – volume: 8 start-page: 8367 issue: 12 year: 2012 ident: 10.1016/j.micpro.2015.01.003_b0030 article-title: A multi-character transition string matching architecture based on Aho-Corasick algorithm publication-title: Int. J. Innovat. Comput. Inform. Control (IJICIC) – volume: vol. 3203 start-page: 484 year: 2004 ident: 10.1016/j.micpro.2015.01.003_b0070 article-title: Over 10Gbps string matching mechanism for multi-stream packet scanning systems – volume: 7 start-page: 10:1 issue: 2 year: 2010 ident: 10.1016/j.micpro.2015.01.003_b0050 article-title: A memory-efficient pipelined implementation of the Aho-Corasick string-matching algorithm publication-title: ACM Trans. Archit. Code Optim. doi: 10.1145/1839667.1839672 – volume: 4 start-page: 57 issue: 2 year: 2013 ident: 10.1016/j.micpro.2015.01.003_b0100 article-title: Packet inspection on programmable hardware publication-title: Comput. Eng. Intell. Syst. – ident: 10.1016/j.micpro.2015.01.003_b0040 doi: 10.1109/INFCOM.2004.1354682 – volume: 10 start-page: 25 issue: 4 year: 2013 ident: 10.1016/j.micpro.2015.01.003_b0035 article-title: An efficient multicharacter transition string-matching engine based on the Aho-Corasick algorithm publication-title: ACM Trans. Archit. Code Optim. (TACO) – volume: 2 start-page: 21 issue: 1 year: 2006 ident: 10.1016/j.micpro.2015.01.003_b0075 article-title: A parallel string matching engine for use in high speed network intrusion detection systems publication-title: J. Comput. Virol. doi: 10.1007/s11416-006-0010-4 – start-page: 33 year: 2008 ident: 10.1016/j.micpro.2015.01.003_b0105 article-title: Exact multi-pattern string matching on the Cell/B.E. processor – start-page: 415 year: 2009 ident: 10.1016/j.micpro.2015.01.003_b0020 article-title: Variable-stride multi-pattern matching for scalable deep packet inspection – ident: 10.1016/j.micpro.2015.01.003_b0045 doi: 10.1109/ISCC.2008.4625587 – ident: 10.1016/j.micpro.2015.01.003_b0095 doi: 10.1109/FCCM.2004.50 – ident: 10.1016/j.micpro.2015.01.003_b0015 doi: 10.1109/ICNP.2006.320212 – ident: 10.1016/j.micpro.2015.01.003_b0055 doi: 10.1109/ICPADS.2008.47 – volume: vol. 6 start-page: 847 year: 2009 ident: 10.1016/j.micpro.2015.01.003_b0080 article-title: A multi-gb/s parallel string matching engine for intrusion detection systems – ident: 10.1016/j.micpro.2015.01.003_b0090 – ident: 10.1016/j.micpro.2015.01.003_b0060 doi: 10.1109/ICSAMOS.2007.4285750 |
| SSID | ssj0005062 |
| Score | 2.0087512 |
| Snippet | [Display omitted]
•A hybrid finite automaton is proposed with deterministic and nondeterministic parts.•The hybrid FA is capable of inspecting multiple... The throughput of a string-matching engine can be multiplied up by inspecting multiple characters in parallel. However, the space that is required to implement... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 122 |
| SubjectTerms | Aho-Corasick algorithm Architecture Clocks Configurable Deterministic and nondeterministic finite automaton Engines Mathematical analysis Microprocessors Network intrusion detection system Pipelines String matching |
| Title | A hybrid multiple-character transition finite-automaton for string matching engine |
| URI | https://dx.doi.org/10.1016/j.micpro.2015.01.003 https://www.proquest.com/docview/1770286426 |
| Volume | 39 |
| WOSCitedRecordID | wos000352173800007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-9436 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005062 issn: 0141-9331 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3di9QwEA9654MvfovnFxF8WyJJ0-bjcdETFTxETti3kqTpeYd2l-uunP-9kyZpl1vkVPAllGza3WR-O5lMfzOD0Etu2pJbaklIvk1KISzRsE0S2FtcpeH8QQszFJuQR0dqsdCfEq2oH8oJyK5TFxd69V9FDX0g7BA6-xfiHh8KHXANQocWxA7tHwl-Pvv6M4RhjVxB4nJS5lAQooskrVl7GqxNYjbrJRitiW8Yinh0JzPoiBRLP2Qr3DZgPwYC3ypGF4Q6PcHv_j309Vupzwe6gE-v80F3EGgnz31yUMOAE_LGb7sdWDXxrqIvbCceJrknGdE5BstHlapkQXQZ05xknRsTGCVsFVsKlMUo5bQXs-jo3FHz0eNw9grmBzMOBL2YfJXyaVsbyYaBv8bCj2LVcCIS19F-ISsNanx__v5w8WGiBNGhAO04ixxqOfABd7_rd6bMpU19sFSO76Bb6YiB5xEad9E1391Dt3P5Dpy0-X30eY4jUvAuUvCEFHwZKRiQgiNScEYKjkh5gL68PTx-_Y6kEhvEca7XBE4rxjct1w4uGm-LRtLWeOoVk42nrXWN9l5ZwYXURsHp3VVVUxlhDZfOOP4Q7XXLzj9C2FNV2lIYXlleOsktUw1lDQw3hRLMHiCeV6t2Kf98KIPyrc5Ew7M6rnEd1rimLOStPUBkvGsV869cMV5mQdTJhoy2YQ3YueLOF1lu8Gkf3puZzi83fc2kBCscDuri8T8__Qm6Of2LnqK99fnGP0M33I_1aX_-PAHxF-bcpyU |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+hybrid+multiple-character+transition+finite-automaton+for+string+matching+engine&rft.jtitle=Microprocessors+and+microsystems&rft.au=Chen%2C+Chien-Chi&rft.au=Wang%2C+Sheng-De&rft.date=2015-03-01&rft.pub=Elsevier+B.V&rft.issn=0141-9331&rft.eissn=1872-9436&rft.volume=39&rft.issue=2&rft.spage=122&rft.epage=134&rft_id=info:doi/10.1016%2Fj.micpro.2015.01.003&rft.externalDocID=S0141933115000046 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0141-9331&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0141-9331&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0141-9331&client=summon |