{"id":"https://openalex.org/W2614275181","doi":"https://doi.org/10.1109/fpt.2016.7929431","title":"High-speed regular expression matching with pipelined automata","display_name":"High-speed regular expression matching with pipelined automata","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2614275181","doi":"https://doi.org/10.1109/fpt.2016.7929431","mag":"2614275181"},"language":"en","primary_location":{"id":"doi:10.1109/fpt.2016.7929431","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fpt.2016.7929431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Field-Programmable Technology (FPT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040170587","display_name":"Denis Matou\u0161ek","orcid":null},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Denis Matousek","raw_affiliation_strings":["Faculty of Information Technology, Brno University of Technology, Brno, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Brno University of Technology, Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021958683","display_name":"Jan Ko\u0159enek","orcid":"https://orcid.org/0000-0002-4662-7349"},"institutions":[{"id":"https://openalex.org/I54634078","display_name":"CESNET, z\u00e1jmov\u00e9 sdru\u017een\u00ed pr\u00e1vnick\u00fdch osob","ror":"https://ror.org/050dkka69","country_code":"CZ","type":"other","lineage":["https://openalex.org/I54634078"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Korenek","raw_affiliation_strings":["CESNET a.l.e., Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CESNET a.l.e., Prague, Czech Republic","institution_ids":["https://openalex.org/I54634078"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089906795","display_name":"Viktor Pu\u0161","orcid":null},"institutions":[{"id":"https://openalex.org/I54634078","display_name":"CESNET, z\u00e1jmov\u00e9 sdru\u017een\u00ed pr\u00e1vnick\u00fdch osob","ror":"https://ror.org/050dkka69","country_code":"CZ","type":"other","lineage":["https://openalex.org/I54634078"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Viktor Pus","raw_affiliation_strings":["CESNET a.l.e., Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CESNET a.l.e., Prague, Czech Republic","institution_ids":["https://openalex.org/I54634078"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2432,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.88207461,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"93","last_page":"100"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.7988744378089905},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7072001099586487},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.582000195980072},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.520433247089386},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5196060538291931},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.5066505074501038},{"id":"https://openalex.org/keywords/cellular-automaton","display_name":"Cellular automaton","score":0.45608752965927124},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.4220195412635803},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3038334846496582},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3032592535018921},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19647938013076782},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13807952404022217},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13637009263038635}],"concepts":[{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.7988744378089905},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7072001099586487},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.582000195980072},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.520433247089386},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5196060538291931},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.5066505074501038},{"id":"https://openalex.org/C35527583","wikidata":"https://www.wikidata.org/wiki/Q189156","display_name":"Cellular automaton","level":2,"score":0.45608752965927124},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.4220195412635803},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3038334846496582},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3032592535018921},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19647938013076782},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13807952404022217},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13637009263038635},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fpt.2016.7929431","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fpt.2016.7929431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Field-Programmable Technology (FPT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.44999998807907104}],"awards":[],"funders":[{"id":"https://openalex.org/F4320315323","display_name":"Technology Agency of the Czech Republic","ror":null},{"id":"https://openalex.org/F4320322748","display_name":"Vysok\u00e9 U\u010den\u00ed Technick\u00e9 v Brn\u011b","ror":"https://ror.org/03613d656"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1490509368","https://openalex.org/W1516506771","https://openalex.org/W1655192411","https://openalex.org/W1707172707","https://openalex.org/W1960511147","https://openalex.org/W2030102079","https://openalex.org/W2067845746","https://openalex.org/W2073709434","https://openalex.org/W2079329309","https://openalex.org/W2097960294","https://openalex.org/W2100272440","https://openalex.org/W2111990320","https://openalex.org/W2113422425","https://openalex.org/W2113425091","https://openalex.org/W2115345034","https://openalex.org/W2122820686","https://openalex.org/W2147025186","https://openalex.org/W2153244370","https://openalex.org/W2170523504","https://openalex.org/W2189054384","https://openalex.org/W3144157896","https://openalex.org/W4242309756","https://openalex.org/W6637452973"],"related_works":["https://openalex.org/W1774017438","https://openalex.org/W2123199373","https://openalex.org/W4246925412","https://openalex.org/W2083577879","https://openalex.org/W4205780093","https://openalex.org/W2952363982","https://openalex.org/W2109464334","https://openalex.org/W2031647786","https://openalex.org/W2052853109","https://openalex.org/W2100501061"],"abstract_inverted_index":{"Pattern":[0],"matching":[1,23,47,93],"is":[2,7,36],"a":[3,37,86,111,158],"complex":[4],"task":[5],"which":[6],"widely":[8],"used":[9,71],"in":[10,29],"network":[11,20],"security":[12],"monitoring":[13],"applications.":[14],"With":[15],"the":[16,50,96,122,126,143,146,171],"growing":[17],"speed":[18],"of":[19,45,56,58,77,121,128,139,148,175],"links,":[21],"pattern":[22,46,92],"architectures":[24],"have":[25,84],"to":[26,31,42,130,134,169,173],"be":[27,70],"improved":[28],"order":[30],"retain":[32],"wire-speed":[33],"processing.":[34],"Multi-striding":[35],"well-known":[38],"technique":[39,98],"on":[40,162],"how":[41],"increase":[43],"throughput":[44,74,165],"architectures.":[48],"In":[49],"paper":[51],"we":[52,83],"provide":[53],"an":[54],"analysis":[55],"scalability":[57],"multi-striding":[59,97],"and":[60,68,99,164,166],"show":[61],"that":[62,94],"it":[63],"does":[64],"not":[65],"scale":[66,170],"well":[67],"cannot":[69],"for":[72,90,115],"100Gbps":[73],"because":[75],"utilization":[76],"FPGA":[78],"resources":[79],"grows":[80],"exponentially.":[81],"Therefore,":[82],"designed":[85],"new":[87],"hardware":[88],"architecture":[89,109,144,172],"high-speed":[91],"combines":[95],"parallel":[100,117,136],"processing":[101,152],"using":[102],"pipelined":[103,151],"finite":[104],"state":[105],"machines":[106],"(FSMs).":[107],"The":[108],"shares":[110],"single":[112],"packet":[113,123],"buffer":[114,124],"all":[116],"FSMs.":[118,149],"Efficient":[119],"implementation":[120],"reduces":[125],"number":[127],"BlockRAMs":[129],"18%":[131],"when":[132],"compared":[133],"simple":[135],"implementation.":[137],"Instead":[138],"multiplexing":[140],"input":[141],"data,":[142],"pipelines":[145],"states":[147],"Such":[150],"with":[153],"only":[154],"local":[155],"communication":[156],"has":[157],"direct":[159],"positive":[160],"impact":[161],"frequency":[163],"allows":[167],"us":[168],"hundreds":[174],"Gbps.":[176]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}