{"id":"https://openalex.org/W3045749813","doi":"https://doi.org/10.1109/icc40277.2020.9149071","title":"Accounting for Information Freshness in Scheduling of Content Caching","display_name":"Accounting for Information Freshness in Scheduling of Content Caching","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3045749813","doi":"https://doi.org/10.1109/icc40277.2020.9149071","mag":"3045749813"},"language":"en","primary_location":{"id":"doi:10.1109/icc40277.2020.9149071","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc40277.2020.9149071","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5003510613","display_name":"Ghafour Ahani","orcid":"https://orcid.org/0000-0003-1869-6192"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Ghafour Ahani","raw_affiliation_strings":["Department of Information Technology, Uppsala University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100657039","display_name":"Di Yuan","orcid":"https://orcid.org/0000-0001-8119-5206"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Di Yuan","raw_affiliation_strings":["Department of Information Technology, Uppsala University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I123387679"],"apc_list":null,"apc_paid":null,"fwci":3.747,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.94587843,"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":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9998999834060669,"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/T13553","display_name":"Age of Information Optimization","score":0.9998999834060669,"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/T11478","display_name":"Caching and Content Delivery","score":0.9955999851226807,"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/T12079","display_name":"IoT Networks and Protocols","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/backhaul","display_name":"Backhaul (telecommunications)","score":0.8590049743652344},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.812087893486023},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6525435447692871},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6185248494148254},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6013020873069763},{"id":"https://openalex.org/keywords/base-station","display_name":"Base station","score":0.48290205001831055},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4813545346260071},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3673015236854553},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3275737762451172},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10464990139007568}],"concepts":[{"id":"https://openalex.org/C103760667","wikidata":"https://www.wikidata.org/wiki/Q798444","display_name":"Backhaul (telecommunications)","level":3,"score":0.8590049743652344},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.812087893486023},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6525435447692871},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6185248494148254},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6013020873069763},{"id":"https://openalex.org/C68649174","wikidata":"https://www.wikidata.org/wiki/Q1379116","display_name":"Base station","level":2,"score":0.48290205001831055},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4813545346260071},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3673015236854553},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3275737762451172},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10464990139007568},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc40277.2020.9149071","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc40277.2020.9149071","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1972738071","https://openalex.org/W2011039300","https://openalex.org/W2037169571","https://openalex.org/W2076238075","https://openalex.org/W2278115387","https://openalex.org/W2610993542","https://openalex.org/W2742721402","https://openalex.org/W2744248483","https://openalex.org/W2744738782","https://openalex.org/W2783926823","https://openalex.org/W2794673877","https://openalex.org/W2917413290","https://openalex.org/W2963018208","https://openalex.org/W2963220642","https://openalex.org/W2963543583","https://openalex.org/W2963721147","https://openalex.org/W2964150361","https://openalex.org/W3049266556","https://openalex.org/W4246219036","https://openalex.org/W6767829079"],"related_works":["https://openalex.org/W4297310313","https://openalex.org/W2963149344","https://openalex.org/W2097644939","https://openalex.org/W2012551222","https://openalex.org/W4200445394","https://openalex.org/W4303414366","https://openalex.org/W2041847789","https://openalex.org/W2594059527","https://openalex.org/W1724300815","https://openalex.org/W2357429841"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,89,105,120],"study":[4],"the":[5,27,43,52,64,72,77,85,97],"problem":[6],"of":[7,10,32,42,45,54,56,66,74],"optimal":[8],"scheduling":[9],"content":[11],"placement":[12],"along":[13],"time":[14],"in":[15,40,76],"a":[16,80,94,102,107,115],"base":[17],"station":[18],"with":[19],"limited":[20],"cache":[21,78],"capacity,":[22],"taking":[23],"into":[24],"account":[25],"jointly":[26],"offloading":[28,36],"effect":[29],"and":[30,47,114],"freshness":[31,49],"information.":[33],"We":[34],"model":[35],"based":[37,50,110],"on":[38,51,111],"popularity":[39],"terms":[41],"number":[44],"requests":[46],"information":[48,57],"notion":[53],"age":[55],"(AoI).":[58],"The":[59],"objective":[60],"is":[61],"to":[62],"reduce":[63],"load":[65],"backhaul":[67],"links":[68],"as":[69,71],"well":[70],"AoI":[73],"contents":[75],"via":[79,93,101],"joint":[81],"cost":[82],"function.":[83],"For":[84],"resulting":[86],"optimization":[87],"problem,":[88],"prove":[90],"its":[91],"hardness":[92],"reduction":[95],"from":[96],"Partition":[98],"problem.":[99],"Next,":[100],"mathematical":[103],"reformulation,":[104],"derive":[106],"solution":[108],"approach":[109],"column":[112],"generation":[113],"tailored":[116],"rounding":[117],"mechanism.":[118],"Finally,":[119],"provide":[121],"performance":[122],"evaluation":[123],"results":[124],"showing":[125],"that":[126],"our":[127],"algorithm":[128],"provides":[129],"near-optimal":[130],"solutions.":[131]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}