{"id":"https://openalex.org/W2540609487","doi":"https://doi.org/10.1109/tnet.2016.2611482","title":"Optimal Rule Caching and Lossy Compression for Longest Prefix Matching","display_name":"Optimal Rule Caching and Lossy Compression for Longest Prefix Matching","publication_year":2016,"publication_date":"2016-10-26","ids":{"openalex":"https://openalex.org/W2540609487","doi":"https://doi.org/10.1109/tnet.2016.2611482","mag":"2540609487"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2016.2611482","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2016.2611482","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-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/A5010514482","display_name":"Ori Rottenstreich","orcid":"https://orcid.org/0000-0002-4064-1238"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ori Rottenstreich","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062012037","display_name":"J\u00e1nos Tapolcai","orcid":"https://orcid.org/0000-0002-3512-9504"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Janos Tapolcai","raw_affiliation_strings":["MTA-BME Future Internet Research Group, Budapest University of Technology and Economics, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"MTA-BME Future Internet Research Group, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5010514482"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":5.1196,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.95849263,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"25","issue":"2","first_page":"864","last_page":"878"},"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.9968000054359436,"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.9933000206947327,"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.7834757566452026},{"id":"https://openalex.org/keywords/lossy-compression","display_name":"Lossy compression","score":0.6347367763519287},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.5854972004890442},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5693995356559753},{"id":"https://openalex.org/keywords/classifier","display_name":"Classifier (UML)","score":0.5000917911529541},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4111732244491577},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2694472074508667},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22689402103424072}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7834757566452026},{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.6347367763519287},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.5854972004890442},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5693995356559753},{"id":"https://openalex.org/C95623464","wikidata":"https://www.wikidata.org/wiki/Q1096149","display_name":"Classifier (UML)","level":2,"score":0.5000917911529541},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4111732244491577},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2694472074508667},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22689402103424072},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tnet.2016.2611482","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2016.2611482","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"},{"id":"pmh:oai:real.mtak.hu:63701","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400081","display_name":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210140733","host_organization_name":"Library and Information Centre of the Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I4210140733"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[{"id":"https://openalex.org/G293009331","display_name":null,"funder_award_id":"OTKA 108947","funder_id":"https://openalex.org/F4320321994","funder_display_name":"Hungarian Scientific Research Fund"}],"funders":[{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W1565047455","https://openalex.org/W1869912679","https://openalex.org/W1966685059","https://openalex.org/W1970919734","https://openalex.org/W1986399639","https://openalex.org/W2011479742","https://openalex.org/W2015820470","https://openalex.org/W2025710913","https://openalex.org/W2040903332","https://openalex.org/W2055113824","https://openalex.org/W2059244051","https://openalex.org/W2060108852","https://openalex.org/W2062143991","https://openalex.org/W2071253586","https://openalex.org/W2074295506","https://openalex.org/W2076106147","https://openalex.org/W2094598943","https://openalex.org/W2096933299","https://openalex.org/W2098937115","https://openalex.org/W2106863923","https://openalex.org/W2111410297","https://openalex.org/W2115907784","https://openalex.org/W2122962290","https://openalex.org/W2125595930","https://openalex.org/W2125965447","https://openalex.org/W2126926261","https://openalex.org/W2132074944","https://openalex.org/W2134519279","https://openalex.org/W2137216984","https://openalex.org/W2139221507","https://openalex.org/W2139822900","https://openalex.org/W2141062513","https://openalex.org/W2144722725","https://openalex.org/W2150942100","https://openalex.org/W2156813924","https://openalex.org/W2157054323","https://openalex.org/W2157422153","https://openalex.org/W2169383296","https://openalex.org/W2264578237","https://openalex.org/W2309084203","https://openalex.org/W2460461231","https://openalex.org/W2515027412","https://openalex.org/W2526308980","https://openalex.org/W2530249316","https://openalex.org/W3093756599","https://openalex.org/W4206060609","https://openalex.org/W4239923192","https://openalex.org/W4247168681","https://openalex.org/W4255814888","https://openalex.org/W6639213241","https://openalex.org/W6676487306","https://openalex.org/W6726357178"],"related_works":["https://openalex.org/W1995805316","https://openalex.org/W2387503788","https://openalex.org/W2142481367","https://openalex.org/W3196321793","https://openalex.org/W3080705045","https://openalex.org/W2385527937","https://openalex.org/W2005880840","https://openalex.org/W2059658550","https://openalex.org/W4287903946","https://openalex.org/W2507465767"],"abstract_inverted_index":{"Packet":[0],"classification":[1,20,136,154],"is":[2,21,107,159],"a":[3,110,120,147,156,199,227],"building":[4],"block":[5],"in":[6,91,132,167,221],"many":[7],"network":[8],"services,":[9],"such":[10],"as":[11],"routing,":[12],"monitoring,":[13],"and":[14,39,49,68,94,180,215,218],"policy":[15],"enforcement.":[16],"In":[17,58],"commodity":[18,133],"switches,":[19],"often":[22],"performed":[23],"by":[24,230],"memory":[25,43,78],"components":[26,44],"of":[27,65,84,123,138,150,188,202,232],"various":[28],"rule":[29,66,169],"matching":[30],"patterns":[31],"(longest":[32],"prefix":[33,103,113],"match,":[34,38],"ternary":[35],"matches,":[36],"exact":[37],"so":[40,126],"on).":[41],"The":[42],"are":[45],"fast":[46],"but":[47],"expensive":[48],"power-hungry":[50],"with":[51,135,204],"power":[52,95],"consumption":[53],"proportional":[54],"to":[55,71,108,183],"their":[56,92,210],"size.":[57,140],"this":[59],"paper,":[60],"we":[61,224],"study":[62],"the":[63,80,85,101,124,143,168,185],"applicability":[64],"caching":[67,170],"lossy":[69,144],"compression":[70,145],"create":[72],"packet":[73],"classifiers":[74,203,214],"requiring":[75],"much":[76],"less":[77],"than":[79],"theoretical":[81],"size":[82,229],"limits":[83],"semantically-equivalent":[86],"representations,":[87],"enabling":[88],"significant":[89],"reduction":[90],"cost":[93],"consumption.":[96],"This":[97],"paper":[98],"focuses":[99],"on":[100,212],"longest":[102,112],"matching.":[104],"Our":[105],"objective":[106],"find":[109],"limited-size":[111],"match":[114],"classifier":[115,228],"that":[116,127,163,190,220],"can":[117,129,225],"correctly":[118],"classify":[119],"high":[121],"portion":[122],"traffic,":[125],"it":[128],"be":[130,165,192],"implemented":[131],"switches":[134],"modules":[137],"restricted":[139],"While":[141],"for":[142,161,177,198],"scheme":[146],"small":[148,186],"amount":[149,187],"traffic":[151,162,189,216,239],"might":[152],"observe":[153],"errors,":[155],"special":[157],"indication":[158],"returned":[160],"cannot":[164,191],"classified":[166],"scheme.":[171],"We":[172,194,208],"develop":[173],"optimal":[174],"dynamic-programming":[175],"algorithms":[176],"both":[178],"problems":[179],"describe":[181],"how":[182],"treat":[184],"classified.":[193],"generalize":[195],"our":[196],"solutions":[197],"wide":[200],"range":[201],"different":[205],"similarity":[206],"metrics.":[207],"evaluate":[209],"performance":[211],"real":[213],"traces":[217],"show":[219],"some":[222],"cases":[223],"reduce":[226],"orders":[231],"magnitude":[233],"while":[234],"still":[235],"classifying":[236],"almost":[237],"all":[238],"correctly.":[240]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}