{"id":"https://openalex.org/W1969792688","doi":"https://doi.org/10.1109/noms.2012.6211894","title":"Deterministic Finite Automaton for scalable traffic identification: The power of compressing by range","display_name":"Deterministic Finite Automaton for scalable traffic identification: The power of compressing by range","publication_year":2012,"publication_date":"2012-04-01","ids":{"openalex":"https://openalex.org/W1969792688","doi":"https://doi.org/10.1109/noms.2012.6211894","mag":"1969792688"},"language":"en","primary_location":{"id":"doi:10.1109/noms.2012.6211894","is_oa":false,"landing_page_url":"https://doi.org/10.1109/noms.2012.6211894","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Network Operations and Management Symposium","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/A5102895403","display_name":"Riccardo Antonello","orcid":"https://orcid.org/0000-0003-4221-2004"},"institutions":[{"id":"https://openalex.org/I25112270","display_name":"Universidade Federal de Pernambuco","ror":"https://ror.org/047908t24","country_code":"BR","type":"education","lineage":["https://openalex.org/I25112270"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"R. Antonello","raw_affiliation_strings":["Federal University of Pernambuco (UFPE), Recife, Brazil","Federal University of Pernambuco (UFPE); Recife Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Pernambuco (UFPE), Recife, Brazil","institution_ids":["https://openalex.org/I25112270"]},{"raw_affiliation_string":"Federal University of Pernambuco (UFPE); Recife Brazil","institution_ids":["https://openalex.org/I25112270"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037353382","display_name":"St\u00eanio Fernandes","orcid":"https://orcid.org/0000-0002-4180-115X"},"institutions":[{"id":"https://openalex.org/I25112270","display_name":"Universidade Federal de Pernambuco","ror":"https://ror.org/047908t24","country_code":"BR","type":"education","lineage":["https://openalex.org/I25112270"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"S. Fernandes","raw_affiliation_strings":["Federal University of Pernambuco (UFPE), Recife, Brazil","Federal University of Pernambuco (UFPE); Recife Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Pernambuco (UFPE), Recife, Brazil","institution_ids":["https://openalex.org/I25112270"]},{"raw_affiliation_string":"Federal University of Pernambuco (UFPE); Recife Brazil","institution_ids":["https://openalex.org/I25112270"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014967408","display_name":"Djamel Sadok","orcid":"https://orcid.org/0000-0001-5378-4732"},"institutions":[{"id":"https://openalex.org/I25112270","display_name":"Universidade Federal de Pernambuco","ror":"https://ror.org/047908t24","country_code":"BR","type":"education","lineage":["https://openalex.org/I25112270"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"D. Sadok","raw_affiliation_strings":["Federal University of Pernambuco (UFPE), Recife, Brazil","Federal University of Pernambuco (UFPE); Recife Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Pernambuco (UFPE), Recife, Brazil","institution_ids":["https://openalex.org/I25112270"]},{"raw_affiliation_string":"Federal University of Pernambuco (UFPE); Recife Brazil","institution_ids":["https://openalex.org/I25112270"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026724035","display_name":"Judith Kelner","orcid":"https://orcid.org/0000-0002-2673-5887"},"institutions":[{"id":"https://openalex.org/I25112270","display_name":"Universidade Federal de Pernambuco","ror":"https://ror.org/047908t24","country_code":"BR","type":"education","lineage":["https://openalex.org/I25112270"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"J. Kelner","raw_affiliation_strings":["Federal University of Pernambuco (UFPE), Recife, Brazil","Federal University of Pernambuco (UFPE); Recife Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Pernambuco (UFPE), Recife, Brazil","institution_ids":["https://openalex.org/I25112270"]},{"raw_affiliation_string":"Federal University of Pernambuco (UFPE); Recife Brazil","institution_ids":["https://openalex.org/I25112270"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043986697","display_name":"G\u00e9za Szab\u00f3","orcid":"https://orcid.org/0000-0003-0553-6958"},"institutions":[{"id":"https://openalex.org/I4210131589","display_name":"Ericsson (Hungary)","ror":"https://ror.org/03c0yyz21","country_code":"HU","type":"company","lineage":["https://openalex.org/I1306339040","https://openalex.org/I4210131589"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"G. Szabo","raw_affiliation_strings":["Ericsson Traffic Laboratory, Budapest, Hungary","Ericsson Traffic Lab, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ericsson Traffic Laboratory, Budapest, Hungary","institution_ids":["https://openalex.org/I4210131589"]},{"raw_affiliation_string":"Ericsson Traffic Lab, Budapest, Hungary","institution_ids":["https://openalex.org/I4210131589"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5102895403"],"corresponding_institution_ids":["https://openalex.org/I25112270"],"apc_list":null,"apc_paid":null,"fwci":2.9286,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.90441309,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9987999796867371,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9976000189781189,"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/deep-packet-inspection","display_name":"Deep packet inspection","score":0.8541391491889954},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.7489075660705566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7444950938224792},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.7401173114776611},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.6847739219665527},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5800510048866272},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5568985342979431},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.555365264415741},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5075873136520386},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5067973732948303},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.49027350544929504},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.4519571363925934},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4481196403503418},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.4277041256427765},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.42223986983299255},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.41626057028770447},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.33316415548324585},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.1464518904685974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14618447422981262},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07842114567756653}],"concepts":[{"id":"https://openalex.org/C204679922","wikidata":"https://www.wikidata.org/wiki/Q734252","display_name":"Deep packet inspection","level":3,"score":0.8541391491889954},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.7489075660705566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7444950938224792},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.7401173114776611},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.6847739219665527},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5800510048866272},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5568985342979431},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.555365264415741},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5075873136520386},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5067973732948303},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.49027350544929504},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.4519571363925934},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4481196403503418},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.4277041256427765},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.42223986983299255},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.41626057028770447},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.33316415548324585},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.1464518904685974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14618447422981262},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07842114567756653},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/noms.2012.6211894","is_oa":false,"landing_page_url":"https://doi.org/10.1109/noms.2012.6211894","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Network Operations and Management Symposium","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.666.3972","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.666.3972","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cial.csie.ncku.edu.tw/presentation/group_pdf/Deterministic+Finite+Automaton+for+Scalable+Traffic.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.724.3886","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.724.3886","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.crysys.hu/%7Eszabog/index_files/NOMS2012.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1849161695","https://openalex.org/W2030102079","https://openalex.org/W2096474000","https://openalex.org/W2100038334","https://openalex.org/W2103933781","https://openalex.org/W2113425091","https://openalex.org/W2113455529","https://openalex.org/W2119423764","https://openalex.org/W2139418336","https://openalex.org/W2154195006","https://openalex.org/W2164962747","https://openalex.org/W2167971042","https://openalex.org/W6639048092"],"related_works":["https://openalex.org/W2024315516","https://openalex.org/W2325454122","https://openalex.org/W2089404966","https://openalex.org/W2377966853","https://openalex.org/W2113425091","https://openalex.org/W2139519154","https://openalex.org/W1966360562","https://openalex.org/W2010706856","https://openalex.org/W2408583837","https://openalex.org/W2186499132"],"abstract_inverted_index":{"Deep":[0],"Packet":[1],"Inspection":[2],"(DPI)":[3],"systems":[4,34,58],"have":[5],"been":[6],"becoming":[7],"an":[8],"important":[9],"element":[10],"in":[11],"traffic":[12],"measurement":[13],"ever":[14],"since":[15],"port-based":[16],"classification":[17],"was":[18],"deemed":[19],"no":[20],"longer":[21],"appropriate,":[22],"due":[23],"to":[24,45,76,119,125],"protocol":[25],"tunneling":[26],"and":[27,41,67,117],"misuses":[28],"of":[29,52,79,111],"well-defined":[30],"ports.":[31],"Current":[32],"DPI":[33,57],"express":[35],"application":[36],"signatures":[37],"using":[38],"regular":[39],"expressions":[40],"it":[42],"is":[43],"usual":[44],"perform":[46],"pattern":[47],"matching":[48],"through":[49],"the":[50,114,126],"use":[51],"Finite":[53,87,93],"Automaton":[54,94],"(FA).":[55],"Although":[56],"are":[59,64],"essentially":[60],"more":[61],"accurate,":[62],"they":[63],"also":[65],"resource-intensive":[66],"do":[68],"not":[69],"scale":[70],"well":[71],"with":[72],"link":[73],"speeds.":[74],"Looking":[75],"this":[77,81],"area":[78],"interest,":[80],"paper":[82],"proposes":[83],"a":[84],"novel":[85],"Deterministic":[86,92],"Automaton,":[88],"called":[89],"Ranged":[90],"Compressed":[91],"(RCDFA),":[95],"that":[96,106],"compresses":[97],"transitions":[98],"without":[99],"additional":[100],"memory":[101],"lookups.":[102],"Experimental":[103],"results":[104],"show":[105],"RCDFA":[107],"yields":[108],"space":[109],"savings":[110],"97%":[112],"over":[113],"original":[115],"DFA":[116],"up":[118],"93%":[120],"better":[121],"compression":[122,129],"when":[123],"compared":[124],"DFA's":[127],"state-of-the-art":[128],"techniques.":[130]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-05-03T08:25:01.440150","created_date":"2025-10-10T00:00:00"}