{"id":"https://openalex.org/W2027627461","doi":"https://doi.org/10.1109/infcom.2010.5462160","title":"CompactDFA: Generic State Machine Compression for Scalable Pattern Matching","display_name":"CompactDFA: Generic State Machine Compression for Scalable Pattern Matching","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W2027627461","doi":"https://doi.org/10.1109/infcom.2010.5462160","mag":"2027627461"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2010.5462160","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2010.5462160","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Proceedings IEEE INFOCOM","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/A5091083281","display_name":"Anat Bremler-Barr","orcid":"https://orcid.org/0000-0002-8165-2558"},"institutions":[{"id":"https://openalex.org/I138898306","display_name":"Reichman University","ror":"https://ror.org/01px5cv07","country_code":"IL","type":"education","lineage":["https://openalex.org/I138898306"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Anat Bremler-Barr","raw_affiliation_strings":["Computer Science Department, Interdisciplinary Center, Herzliya, Israel","Computer Science Dept., Interdisciplinary Center, Herzliya, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Interdisciplinary Center, Herzliya, Israel","institution_ids":["https://openalex.org/I138898306"]},{"raw_affiliation_string":"Computer Science Dept., Interdisciplinary Center, Herzliya, Israel#TAB#","institution_ids":["https://openalex.org/I138898306"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058542634","display_name":"David Hay","orcid":"https://orcid.org/0000-0001-9349-6049"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Hay","raw_affiliation_strings":["Department of Electrical Engineering, Columbia University, NY, USA","Department of Electrical Engineering, Columbia University, NY"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Columbia University, NY, USA","institution_ids":["https://openalex.org/I78577930"]},{"raw_affiliation_string":"Department of Electrical Engineering, Columbia University, NY","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084188510","display_name":"Yaron Koral","orcid":"https://orcid.org/0000-0002-0752-2122"},"institutions":[{"id":"https://openalex.org/I138898306","display_name":"Reichman University","ror":"https://ror.org/01px5cv07","country_code":"IL","type":"education","lineage":["https://openalex.org/I138898306"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yaron Koral","raw_affiliation_strings":["Computer Science Department, Interdisciplinary Center, Herzliya, Israel","Computer Science Dept., Interdisciplinary Center, Herzliya, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Interdisciplinary Center, Herzliya, Israel","institution_ids":["https://openalex.org/I138898306"]},{"raw_affiliation_string":"Computer Science Dept., Interdisciplinary Center, Herzliya, Israel#TAB#","institution_ids":["https://openalex.org/I138898306"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5091083281"],"corresponding_institution_ids":["https://openalex.org/I138898306"],"apc_list":null,"apc_paid":null,"fwci":5.8119,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.96539857,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"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.9872000217437744,"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.9821000099182129,"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/computer-science","display_name":"Computer science","score":0.8544245362281799},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.6442150473594666},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.6320402026176453},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5485419631004333},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.5298395156860352},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4724296033382416},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.4714062213897705},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4701671302318573},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.46668538451194763},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.46582671999931335},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.45658794045448303},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44176262617111206},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.4376167058944702},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.41211050748825073},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3883957862854004},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.2956094741821289},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.1072155237197876}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8544245362281799},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.6442150473594666},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.6320402026176453},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5485419631004333},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.5298395156860352},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4724296033382416},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.4714062213897705},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4701671302318573},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.46668538451194763},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.46582671999931335},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.45658794045448303},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44176262617111206},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.4376167058944702},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.41211050748825073},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3883957862854004},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2956094741821289},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.1072155237197876},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2010.5462160","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2010.5462160","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.714.2235","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.714.2235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.faculty.idc.ac.il/bremler/Papers/infocom10_dfa.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1531610435","https://openalex.org/W1834037038","https://openalex.org/W2086923710","https://openalex.org/W2097719921","https://openalex.org/W2099964107","https://openalex.org/W2108250074","https://openalex.org/W2108522784","https://openalex.org/W2108712752","https://openalex.org/W2110535328","https://openalex.org/W2119335436","https://openalex.org/W2129138880","https://openalex.org/W2131473773","https://openalex.org/W2134684274","https://openalex.org/W2137216984","https://openalex.org/W2143847190","https://openalex.org/W2144392888","https://openalex.org/W2159669151","https://openalex.org/W2171069885","https://openalex.org/W6631793881","https://openalex.org/W6674433126","https://openalex.org/W6677572019","https://openalex.org/W7015284767"],"related_works":["https://openalex.org/W54192826","https://openalex.org/W2074308207","https://openalex.org/W2395357979","https://openalex.org/W2795037468","https://openalex.org/W2154040222","https://openalex.org/W2113425091","https://openalex.org/W1754202134","https://openalex.org/W3092113474","https://openalex.org/W2137664506","https://openalex.org/W2011544743"],"abstract_inverted_index":{"Pattern":[0],"matching":[1,187],"algorithms":[2],"lie":[3],"at":[4],"the":[5,28,35,51,91,94,115,118,183,191],"core":[6],"of":[7,32,67,93,117,136,163,173,185,194,227],"all":[8,146],"contemporary":[9],"Intrusion":[10],"Detection":[11],"Systems":[12],"(IDS),":[13],"making":[14],"it":[15],"intrinsic":[16],"to":[17,63,71,109,148,169,190],"reduce":[18],"their":[19],"speed":[20],"and":[21,43,102,138],"memory":[22],"requirements.":[23],"This":[24,84],"paper":[25],"focuses":[26],"on":[27,41,90],"most":[29],"popular":[30],"class":[31,172],"pattern-matching":[33],"algorithms,":[34,37],"Aho-Corasick-like":[36],"which":[38,76,175],"are":[39],"based":[40],"constructing":[42],"traversing":[44],"a":[45,87,106,143,149,156,161,170,219,225],"Deterministic":[46],"Finite":[47],"Automaton":[48],"(DFA),":[49],"representing":[50],"patterns.":[52],"While":[53,122],"this":[54,134],"approach":[55],"ensures":[56],"deterministic":[57],"time":[58],"guarantees,":[59],"modern":[60],"IDSs":[61],"need":[62],"deal":[64],"with":[65,218,230],"hundreds":[66],"patterns,":[68],"thus":[69],"requiring":[70],"store":[72,125],"very":[73],"large":[74,171],"DFAs":[75,111,124],"usually":[77],"do":[78],"not":[79],"fit":[80],"in":[81,86,141,204,206,212],"fast":[82],"memory.":[83],"results":[85],"major":[88],"bottleneck":[89],"throughput":[92,226],"IDS,":[95],"as":[96,98],"well":[97],"its":[99],"power":[100,232],"consumption":[101],"cost.":[103],"We":[104],"propose":[105],"novel":[107],"method":[108],"compress":[110],"by":[112,155,179],"observing":[113],"that":[114,145,159,199,217],"name":[116],"states":[119,140],"is":[120,188],"meaningless.":[121],"regular":[123],"separately":[126],"each":[127],"transition":[128],"between":[129],"two":[130],"states,":[131],"we":[132,215],"use":[133],"degree":[135],"freedom":[137],"encode":[139],"such":[142],"way":[144],"transitions":[147],"specific":[150],"state":[151],"can":[152,176,200,223],"be":[153,177,201],"represented":[154],"single":[157],"prefix":[158],"defines":[160],"set":[162],"current":[164],"states.":[165],"Our":[166],"technique":[167],"applies":[168],"automata,":[174],"categorized":[178],"simple":[180],"properties.":[181],"Then,":[182],"problem":[184,193],"pattern":[186],"reduced":[189],"well-studied":[192],"Longest":[195],"Prefix":[196],"Matching":[197],"(LPM)":[198],"solved":[202],"either":[203],"TCAM,":[205],"commercially":[207],"available":[208],"IP-lookup":[209],"chips,":[210],"or":[211],"software.":[213],"Specifically,":[214],"show":[216],"TCAM":[220],"our":[221],"scheme":[222],"reach":[224],"10":[228],"Gbps":[229],"low":[231],"consumption.":[233]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}