{"id":"https://openalex.org/W2915868160","doi":"https://doi.org/10.1109/glocom.2018.8647259","title":"Approximation Algorithms for Dependency-Aware Rule-Caching in Software-Defined Networks","display_name":"Approximation Algorithms for Dependency-Aware Rule-Caching in Software-Defined Networks","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2915868160","doi":"https://doi.org/10.1109/glocom.2018.8647259","mag":"2915868160"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2018.8647259","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2018.8647259","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Global Communications Conference (GLOBECOM)","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/A5100600528","display_name":"Jie Wu","orcid":"https://orcid.org/0000-0002-3472-1717"},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jie Wu","raw_affiliation_strings":["Department of Computer and Information Sciences, Temple University"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University","institution_ids":["https://openalex.org/I84392919"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100350503","display_name":"Yang Chen","orcid":"https://orcid.org/0000-0003-4749-3060"},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang Chen","raw_affiliation_strings":["Department of Computer and Information Sciences, Temple University"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University","institution_ids":["https://openalex.org/I84392919"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044419929","display_name":"Huanyang Zheng","orcid":"https://orcid.org/0000-0002-5529-4080"},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Huanyang Zheng","raw_affiliation_strings":["Department of Computer and Information Sciences, Temple University"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University","institution_ids":["https://openalex.org/I84392919"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100600528"],"corresponding_institution_ids":["https://openalex.org/I84392919"],"apc_list":null,"apc_paid":null,"fwci":0.9227,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.78986708,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"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/T11478","display_name":"Caching and Content Delivery","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9998000264167786,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9994000196456909,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8517489433288574},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6228234171867371},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4725848436355591},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.44525274634361267},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39103230834007263},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3642498254776001},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.32621631026268005},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1512928307056427}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8517489433288574},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6228234171867371},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4725848436355591},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.44525274634361267},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39103230834007263},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3642498254776001},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.32621631026268005},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1512928307056427},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2018.8647259","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2018.8647259","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.5299999713897705,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2129377647","https://openalex.org/W2140100092","https://openalex.org/W2147148948","https://openalex.org/W2150942100","https://openalex.org/W2460461231","https://openalex.org/W2523950303","https://openalex.org/W2539195662","https://openalex.org/W2606028552","https://openalex.org/W2775497364","https://openalex.org/W6736437488"],"related_works":["https://openalex.org/W2152099439","https://openalex.org/W1984163603","https://openalex.org/W3130422087","https://openalex.org/W1972035260","https://openalex.org/W3004195166","https://openalex.org/W1563139915","https://openalex.org/W2885669284","https://openalex.org/W4301184821","https://openalex.org/W2126310295","https://openalex.org/W4288413100"],"abstract_inverted_index":{"Software-defined":[0],"networks":[1],"(SDNs)":[2],"can":[3,50],"support":[4],"finegrained":[5],"forwarding":[6],"policies":[7],"in":[8,28,62,108,118,124],"the":[9,38,43,63,119,125,139,146,183],"underlying":[10],"switches.":[11],"The":[12,180],"new":[13],"content":[14],"addressable":[15],"memory,":[16],"Ternary":[17],"Content":[18],"Addressable":[19],"Memory":[20],"(TCAM),":[21],"enables":[22],"fast":[23],"lookups":[24],"for":[25],"matching":[26,46,78,111],"rules":[27,47,61,80,105],"message":[29],"forwarding,":[30],"represented":[31],"as":[32,132],"binary":[33],"strings":[34],"with":[35,159],"wildcards.":[36],"However,":[37],"cost":[39],"and":[40],"power":[41],"limit":[42],"number":[44,140,147],"of":[45,84,92,102,141,148,162,182],"a":[48,82,90,99,109,114,171],"TCAM":[49,64],"support.":[51],"Therefore,":[52],"rule":[53,87,94,115,126,142],"caching":[54],"is":[55,89,98,116,136,176],"needed":[56],"to":[57,129,137],"place":[58],"high-weight":[59],"(high-hit)":[60],"hardware,":[65],"while":[66,144],"large,":[67],"but":[68,178],"slow,":[69],"software":[70],"switches":[71],"handle":[72],"cache-miss":[73],"traffic.":[74],"We":[75],"assume":[76],"that":[77,175],"these":[79],"form":[81],"forest":[83],"trees.":[85],"A":[86],"R'":[88,97],"descendant":[91],"another":[93],"R":[95],"if":[96],"special":[100],"case":[101],"R.":[103],"Dependent":[104],"are":[106,155,186],"evaluated":[107,187],"particular":[110],"order:":[112],"when":[113],"included":[117,131],"cache,":[120],"all":[121],"its":[122],"descendants":[123],"set":[127],"have":[128],"be":[130],"well.":[133],"Our":[134],"objective":[135],"maximize":[138],"hits,":[143],"limiting":[145],"cached":[149],"rules.":[150],"Three":[151],"greedy":[152],"rule-caching":[153],"algorithms":[154],"proposed,":[156],"including":[157],"two":[158],"approximation":[160],"ratios":[161],"2":[163],"and24/5":[164],",":[165],"respectively.":[166],"In":[167],"addition,":[168],"we":[169],"propose":[170],"dynamic":[172],"programming":[173],"solution":[174],"optimal":[177],"slow.":[179],"efficiency":[181],"proposed":[184],"approaches":[185],"through":[188],"real":[189],"data-driven":[190],"simulations.":[191]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}