{"id":"https://openalex.org/W4311414002","doi":"https://doi.org/10.1109/lwc.2022.3211962","title":"Optimal and Suboptimal Dynamic Cache Update Algorithms for Wireless Cellular Networks","display_name":"Optimal and Suboptimal Dynamic Cache Update Algorithms for Wireless Cellular Networks","publication_year":2022,"publication_date":"2022-10-04","ids":{"openalex":"https://openalex.org/W4311414002","doi":"https://doi.org/10.1109/lwc.2022.3211962"},"language":"en","primary_location":{"id":"doi:10.1109/lwc.2022.3211962","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lwc.2022.3211962","pdf_url":null,"source":{"id":"https://openalex.org/S2500830676","display_name":"IEEE Wireless Communications Letters","issn_l":"2162-2337","issn":["2162-2337","2162-2345"],"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 Wireless Communications Letters","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/A5034028474","display_name":"Yaru Fu","orcid":"https://orcid.org/0000-0002-6139-7414"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yaru Fu","raw_affiliation_strings":["School of Science and Technology, Hong Kong Metropolitan University, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"School of Science and Technology, Hong Kong Metropolitan University, Hong Kong, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018874732","display_name":"Jianqing Liu","orcid":"https://orcid.org/0000-0001-7997-5828"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jianqing Liu","raw_affiliation_strings":["School of Science and Technology, Hong Kong Metropolitan University, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"School of Science and Technology, Hong Kong Metropolitan University, Hong Kong, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081169326","display_name":"Junming Ke","orcid":"https://orcid.org/0000-0002-7072-8940"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Junming Ke","raw_affiliation_strings":["Faculty of Science and Technology, University of Tartu, Tartu, Estonia"],"affiliations":[{"raw_affiliation_string":"Faculty of Science and Technology, University of Tartu, Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086102702","display_name":"Kwok Tai Chui","orcid":"https://orcid.org/0000-0001-7992-9901"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"John Kwok Tai Chui","raw_affiliation_strings":["School of Science and Technology, Hong Kong Metropolitan University, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"School of Science and Technology, Hong Kong Metropolitan University, Hong Kong, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051376589","display_name":"Kevin Hung","orcid":"https://orcid.org/0000-0002-5421-7622"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kevin King Fai Hung","raw_affiliation_strings":["School of Science and Technology, Hong Kong Metropolitan University, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"School of Science and Technology, Hong Kong Metropolitan University, Hong Kong, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5034028474"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8291,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.74575199,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"11","issue":"12","first_page":"2610","last_page":"2614"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":1.0,"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":1.0,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9836999773979187,"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/T12288","display_name":"Optimization and Search Problems","score":0.9663000106811523,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.825178861618042},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7513906359672546},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.6892490386962891},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5596134662628174},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5367812514305115},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4483196437358856},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.43702277541160583},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4336162805557251},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4213685989379883},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.38942772150039673},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.26280730962753296},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.1971893310546875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10917723178863525}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.825178861618042},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7513906359672546},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6892490386962891},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5596134662628174},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5367812514305115},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4483196437358856},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.43702277541160583},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4336162805557251},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4213685989379883},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.38942772150039673},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.26280730962753296},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.1971893310546875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10917723178863525},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lwc.2022.3211962","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lwc.2022.3211962","pdf_url":null,"source":{"id":"https://openalex.org/S2500830676","display_name":"IEEE Wireless Communications Letters","issn_l":"2162-2337","issn":["2162-2337","2162-2345"],"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 Wireless Communications Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W254944847","https://openalex.org/W2519564973","https://openalex.org/W2765680238","https://openalex.org/W2803003303","https://openalex.org/W2962896865","https://openalex.org/W2980350531","https://openalex.org/W3011498824","https://openalex.org/W3111318367","https://openalex.org/W3165078509","https://openalex.org/W4226215061"],"related_works":["https://openalex.org/W2546991807","https://openalex.org/W2274935188","https://openalex.org/W2538519144","https://openalex.org/W2037904580","https://openalex.org/W2730690135","https://openalex.org/W2147511796","https://openalex.org/W2109265242","https://openalex.org/W2160946197","https://openalex.org/W4311655071","https://openalex.org/W2141468341"],"abstract_inverted_index":{"In":[0],"this":[1,103],"letter,":[2],"we":[3,58,67,121],"study":[4],"the":[5,22,29,32,36,40,45,48,54,74,79,105,123,132,139,148,172],"dynamic":[6,95,125],"cache":[7,30,174],"update":[8,37,41,186],"problem":[9,77,108],"for":[10,78],"wireless":[11],"content":[12],"caching":[13,50,72,126],"networks.":[14],"The":[15],"cost":[16,24,42,75,161,187],"minimization":[17,76],"perspective":[18],"is":[19,83,109,129,166,188],"considered,":[20],"wherein":[21],"system":[23],"contains":[25],"three":[26],"components,":[27],"including":[28],"cost,":[31,34],"retrieval":[33],"and":[35,62],"cost.":[38],"Particularly,":[39],"lies":[43],"at":[44],"root":[46],"of":[47,150,160],"coded":[49],"strategy.":[51],"To":[52],"address":[53],"non-convex":[55],"optimization":[56,107],"problem,":[57,87],"propose":[59],"both":[60],"suboptimal":[61,118,140],"optimal":[63,124],"algorithms.":[64],"More":[65],"specifically,":[66],"prove":[68],"that":[69,138,171],"with":[70,97],"previous":[71],"state,":[73],"current":[80],"time":[81,100],"interval":[82],"a":[84,94],"0\u20131":[85],"Knapsack":[86],"which":[88,128],"can":[89],"be":[90],"optimally":[91],"solved":[92,110],"by":[93,111],"programming":[96],"pseudo":[98],"polynomial":[99],"complexity.":[101],"On":[102],"basis,":[104],"original":[106],"an":[112,117],"iterative":[113],"manner,":[114],"resulting":[115],"in":[116,158],"solution.":[119],"Thereafter,":[120],"design":[122],"policy,":[127],"derived":[130],"from":[131],"recursive":[133],"algorithm.":[134],"Simulation":[135],"result":[136],"shows":[137],"solution":[141],"achieves":[142],"near-optimal":[143],"performance.":[144],"It":[145],"also":[146],"demonstrates":[147],"superiority":[149],"our":[151],"developed":[152],"strategies":[153],"compared":[154],"to":[155],"various":[156],"baselines":[157],"terms":[159],"saving.":[162],"Moreover,":[163],"counterintuitive":[164],"insight":[165],"judiciously":[167],"acquired,":[168],"such":[169],"as":[170],"high":[173],"capacity":[175],"does":[176],"not":[177],"always":[178],"reveal":[179],"positive":[180],"effect":[181],"on":[182],"system\u2019s":[183],"performance":[184],"when":[185],"taken":[189],"into":[190],"consideration.":[191]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}