{"id":"https://openalex.org/W4289713057","doi":"https://doi.org/10.1109/isit50566.2022.9834866","title":"On Coded Caching Systems with Offline Users","display_name":"On Coded Caching Systems with Offline Users","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289713057","doi":"https://doi.org/10.1109/isit50566.2022.9834866"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834866","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834866","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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/A5078483147","display_name":"Yinbin Ma","orcid":"https://orcid.org/0000-0002-9511-6596"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yinbin Ma","raw_affiliation_strings":["University of Illinois Chicago,Chicago,IL,USA,60607"],"affiliations":[{"raw_affiliation_string":"University of Illinois Chicago,Chicago,IL,USA,60607","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009609470","display_name":"Daniela Tuninetti","orcid":"https://orcid.org/0000-0003-1880-4798"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniela Tuninetti","raw_affiliation_strings":["University of Illinois Chicago,Chicago,IL,USA,60607"],"affiliations":[{"raw_affiliation_string":"University of Illinois Chicago,Chicago,IL,USA,60607","institution_ids":["https://openalex.org/I39422238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078483147"],"corresponding_institution_ids":["https://openalex.org/I39422238"],"apc_list":null,"apc_paid":null,"fwci":2.3781,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.90628476,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1133","last_page":"1138"},"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.989799976348877,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9883999824523926,"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.8778088688850403},{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.8067649602890015},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.718975305557251},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6475253105163574},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.5746712684631348},{"id":"https://openalex.org/keywords/false-sharing","display_name":"False sharing","score":0.5499168038368225},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.5496920943260193},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.5318082571029663},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.511573851108551},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4357713758945465},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4030894637107849},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.3843352198600769},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.1974984109401703}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8778088688850403},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.8067649602890015},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.718975305557251},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6475253105163574},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.5746712684631348},{"id":"https://openalex.org/C5165142","wikidata":"https://www.wikidata.org/wiki/Q5432732","display_name":"False sharing","level":5,"score":0.5499168038368225},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5496920943260193},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.5318082571029663},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.511573851108551},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4357713758945465},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4030894637107849},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.3843352198600769},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.1974984109401703},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834866","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834866","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1990395546","https://openalex.org/W2106248279","https://openalex.org/W2482095914","https://openalex.org/W2527594325","https://openalex.org/W2547052808","https://openalex.org/W2799278985","https://openalex.org/W2889585362","https://openalex.org/W2972837842","https://openalex.org/W3001688473","https://openalex.org/W3045070257","https://openalex.org/W3103610239","https://openalex.org/W3106164725","https://openalex.org/W3204867064","https://openalex.org/W4289713057","https://openalex.org/W6801844915"],"related_works":["https://openalex.org/W1570206749","https://openalex.org/W2793888572","https://openalex.org/W2167303720","https://openalex.org/W2549803267","https://openalex.org/W1508534252","https://openalex.org/W2497617944","https://openalex.org/W2776776727","https://openalex.org/W2962764213","https://openalex.org/W1563139915","https://openalex.org/W2061075966"],"abstract_inverted_index":{"Coded":[0,20],"caching":[1,21,29,129,146],"is":[2,32,59,108,122],"a":[3,34,53,144,174],"technique":[4,36],"that":[5,109],"leverages":[6],"locally":[7],"cached":[8],"contents":[9],"at":[10],"the":[11,15,44,71,85,87,104,113,123,131,187,194,201],"users":[12,64,79,135,150],"to":[13,27,37,61,84,95,165],"reduce":[14],"network\u2019s":[16],"peak-time":[17],"communication":[18],"load.":[19],"achieves":[22],"significant":[23],"performance":[24,39],"gains":[25],"compared":[26],"uncoded":[28],"schemes":[30],"and":[31,50,58,77,154,163,198],"thus":[33],"promising":[35],"boost":[38],"in":[40],"future":[41],"networks.":[42],"In":[43],"original":[45,105],"model":[46,107],"introduced":[47],"by":[48],"Maddah-Ali":[49],"Niesen":[51],"(MAN),":[52],"server":[54,88,114],"stores":[55],"multiple":[56,62],"files":[57],"connected":[60],"cache-aided":[63],"through":[65],"an":[66],"error-free":[67],"shared":[68],"link;":[69],"once":[70],"local":[72],"caches":[73],"have":[74,80],"been":[75],"filled":[76],"all":[78,97,118],"sent":[81],"their":[82],"demand":[83],"server,":[86],"can":[89,183],"start":[90],"sending":[91],"coded":[92,128,145],"multicast":[93],"messages":[94],"satisfy":[96],"users\u2019":[98,119],"demands.":[99],"A":[100],"practical":[101],"limitation":[102],"of":[103,126,133,178,207],"MAN":[106],"it":[110],"halts":[111],"if":[112],"does":[115],"not":[116,199],"receive":[117],"demands,":[120],"which":[121],"limiting":[124],"case":[125],"asynchronous":[127],"when":[130,181],"requests":[132],"some":[134,149],"arrive":[136],"with":[137],"infinite":[138],"delay.":[139],"This":[140],"paper":[141],"formally":[142],"defines":[143],"system":[147],"where":[148],"are":[151,157,172],"offline.":[152],"Achievable":[153],"converse":[155],"bounds":[156],"proposed":[158],"for":[159],"this":[160],"novel":[161],"setting":[162],"shown":[164],"meet":[166],"under":[167],"certain":[168],"conditions;":[169],"otherwise,":[170],"they":[171],"within":[173],"constant":[175],"multiplicative":[176],"gap":[177],"two.":[179],"Interestingly,":[180],"optimality":[182],"be":[184,185],"shown,":[186],"optimal":[188],"load-memory":[189],"tradeoff":[190],"only":[191],"depends":[192],"on":[193,200],"number":[195,206],"active":[196],"users,":[197],"total":[202],"(active":[203],"plus":[204],"offline)":[205],"users.":[208]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}