{"id":"https://openalex.org/W2139418336","doi":"https://doi.org/10.1145/1185347.1185359","title":"Advanced algorithms for fast and scalable deep packet inspection","display_name":"Advanced algorithms for fast and scalable deep packet inspection","publication_year":2006,"publication_date":"2006-12-03","ids":{"openalex":"https://openalex.org/W2139418336","doi":"https://doi.org/10.1145/1185347.1185359","mag":"2139418336"},"language":"en","primary_location":{"id":"doi:10.1145/1185347.1185359","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1185347.1185359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems","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/A5103517707","display_name":"Sailesh Kumar","orcid":null},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sailesh Kumar","raw_affiliation_strings":["Washington University","Washington University, St. Louis, Mo"],"affiliations":[{"raw_affiliation_string":"Washington University","institution_ids":[]},{"raw_affiliation_string":"Washington University, St. Louis, Mo","institution_ids":["https://openalex.org/I204465549"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110102724","display_name":"Jonathan Turner","orcid":null},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan Turner","raw_affiliation_strings":["Washington University","Washington University, St. Louis, Mo"],"affiliations":[{"raw_affiliation_string":"Washington University","institution_ids":[]},{"raw_affiliation_string":"Washington University, St. Louis, Mo","institution_ids":["https://openalex.org/I204465549"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014870940","display_name":"John Williams","orcid":"https://orcid.org/0000-0002-2528-1502"},"institutions":[{"id":"https://openalex.org/I135428043","display_name":"Cisco Systems (United States)","ror":"https://ror.org/03yt1ez60","country_code":"US","type":"company","lineage":["https://openalex.org/I135428043"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Williams","raw_affiliation_strings":["Cisco Systems"],"affiliations":[{"raw_affiliation_string":"Cisco Systems","institution_ids":["https://openalex.org/I135428043"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103517707"],"corresponding_institution_ids":["https://openalex.org/I204465549"],"apc_list":null,"apc_paid":null,"fwci":11.3662,"has_fulltext":false,"cited_by_count":184,"citation_normalized_percentile":{"value":0.9905276,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"81","last_page":"92"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9998999834060669,"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":0.9998999834060669,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9947999715805054,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.994700014591217,"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.8895939588546753},{"id":"https://openalex.org/keywords/deep-packet-inspection","display_name":"Deep packet inspection","score":0.7849240303039551},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.6865445375442505},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.6571323871612549},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.599026620388031},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5748533010482788},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5353840589523315},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5301229357719421},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5109612345695496},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.45315173268318176},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4145796298980713},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.37519416213035583},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.179963618516922},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1512911021709442}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8895939588546753},{"id":"https://openalex.org/C204679922","wikidata":"https://www.wikidata.org/wiki/Q734252","display_name":"Deep packet inspection","level":3,"score":0.7849240303039551},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.6865445375442505},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.6571323871612549},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.599026620388031},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5748533010482788},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5353840589523315},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5301229357719421},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5109612345695496},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.45315173268318176},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4145796298980713},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37519416213035583},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.179963618516922},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1512911021709442},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1185347.1185359","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1185347.1185359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.475.5261","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.475.5261","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://seclab.inha.ac.kr/cgi-bin/TUBoard/db/seminar/upload/1177294998165246034201/Advanced Algorithms for Fast and Scalable Deep packet inspection.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":29,"referenced_works":["https://openalex.org/W124244495","https://openalex.org/W1556957983","https://openalex.org/W1577337656","https://openalex.org/W1601718731","https://openalex.org/W1602427779","https://openalex.org/W1655192411","https://openalex.org/W1674877186","https://openalex.org/W1707172707","https://openalex.org/W1710586424","https://openalex.org/W1891233321","https://openalex.org/W1965680834","https://openalex.org/W2002089154","https://openalex.org/W2006508099","https://openalex.org/W2030102079","https://openalex.org/W2063292248","https://openalex.org/W2096474000","https://openalex.org/W2099964107","https://openalex.org/W2106062486","https://openalex.org/W2116967744","https://openalex.org/W2118599039","https://openalex.org/W2132926044","https://openalex.org/W2134684274","https://openalex.org/W2142702167","https://openalex.org/W2145791740","https://openalex.org/W2149375166","https://openalex.org/W4242309756","https://openalex.org/W4247093768","https://openalex.org/W4251400443","https://openalex.org/W6605045863"],"related_works":["https://openalex.org/W1999162684","https://openalex.org/W2146605784","https://openalex.org/W2159281873","https://openalex.org/W2113425091","https://openalex.org/W2015535429","https://openalex.org/W2022407883","https://openalex.org/W2137664506","https://openalex.org/W1969792688","https://openalex.org/W4242309756","https://openalex.org/W2051822997"],"abstract_inverted_index":{"Modern":[0],"deep":[1],"packet":[2],"inspection":[3],"systems":[4],"use":[5,185],"regular":[6,27,68,102,182],"expressions":[7,103],"to":[8,25,143,157],"define":[9],"various":[10],"patterns":[11,41,179],"of":[12,38,67,101,108,117,178,190,203],"interest":[13],"in":[14,43,134],"network":[15,44],"data":[16],"streams.":[17],"Deterministic":[18],"Finite":[19],"Automata":[20],"(DFA)":[21],"are":[22,30,161],"commonly":[23],"used":[24,156],"parse":[26],"expressions.":[28],"DFAs":[29,76],"fast,":[31],"but":[32,81],"can":[33,153,165],"require":[34,78],"prohibitively":[35],"large":[36],"amounts":[37],"memory":[39,54,60,80,146],"for":[40,173],"arising":[42],"applications.":[45],"Traditional":[46],"DFA":[47,94],"table":[48],"compression":[49],"only":[50],"slightly":[51],"reduces":[52],"the":[53,89,106,135,191,201],"required":[55,193],"and":[56,73,164,199],"requires":[57],"an":[58,174,204],"additional":[59],"access":[61],"per":[62],"input":[63],"character.":[64],"Alternative":[65],"representations":[66],"expressions,":[69,183],"such":[70,151],"as":[71,186,188],"NFAs":[72],"Delayed":[74,92],"Input":[75,93],"(D2FA)":[77],"less":[79],"sacrifice":[82],"throughput.":[83,168],"In":[84],"this":[85],"paper":[86],"we":[87,170],"introduce":[88],"Content":[90],"Addressed":[91],"(CD2FA),":[95],"which":[96,139],"provides":[97],"a":[98,118,125,195],"compact":[99,163],"representation":[100],"that":[104,150,160,172],"match":[105,200],"throughput":[107,202],"traditional":[109],"uncompressed":[110,205],"DFAs.":[111],"A":[112],"CD2FA":[113],"addresses":[114],"successive":[115],"states":[116],"D2FA":[119],"using":[120,176],"their":[121],"content,":[122],"rather":[123],"than":[124],"\"content-less\"":[126],"identifier.":[127],"This":[128],"makes":[129,140],"selected":[130],"information":[131],"available":[132],"earlier":[133],"state":[136],"traversal":[137],"process,":[138],"it":[141],"possible":[142],"avoid":[144],"unnecessary":[145],"accesses.":[147],"We":[148],"demonstrate":[149],"content-addressing":[152],"be":[154],"effectively":[155],"obtain":[158],"automata":[159],"very":[162],"achieve":[166],"high":[167],"Specifically,":[169],"show":[171],"application":[175],"thousands":[177],"defined":[180],"by":[181,194],"CD2FAs":[184],"little":[187],"10%":[189],"space":[192],"conventional":[196],"compressed":[197],"DFA,":[198],"DFA.":[206]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":16}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}