{"id":"https://openalex.org/W2743023974","doi":"https://doi.org/10.1109/isit.2017.8006556","title":"A computer-aided investigation on the fundamental limits of caching","display_name":"A computer-aided investigation on the fundamental limits of caching","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2743023974","doi":"https://doi.org/10.1109/isit.2017.8006556","mag":"2743023974"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006556","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006556","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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/A5100675045","display_name":"Chao Tian","orcid":"https://orcid.org/0000-0001-8752-6141"},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chao Tian","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, The University of Tennessee, Knoxville"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, The University of Tennessee, Knoxville","institution_ids":["https://openalex.org/I75027704"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100675045"],"corresponding_institution_ids":["https://openalex.org/I75027704"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.12506658,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"391","last_page":"395"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9887999892234802,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9739999771118164,"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.6595743298530579},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6147149801254272},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5745003819465637},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5510861277580261},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.47653302550315857},{"id":"https://openalex.org/keywords/linear-inequality","display_name":"Linear inequality","score":0.45638492703437805},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4372588098049164},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.41469815373420715},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40862908959388733},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3925696909427643},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.280875563621521}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6595743298530579},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6147149801254272},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5745003819465637},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5510861277580261},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.47653302550315857},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.45638492703437805},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4372588098049164},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.41469815373420715},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40862908959388733},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3925696909427643},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.280875563621521},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2017.8006556","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006556","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1515040589","https://openalex.org/W1659056652","https://openalex.org/W1934478726","https://openalex.org/W2037413426","https://openalex.org/W2106248279","https://openalex.org/W2114325434","https://openalex.org/W2216774299","https://openalex.org/W2232152748","https://openalex.org/W2513135894","https://openalex.org/W2547052808","https://openalex.org/W2963254016","https://openalex.org/W2963305774","https://openalex.org/W2963492973","https://openalex.org/W2964122203","https://openalex.org/W3103610239","https://openalex.org/W6729390246"],"related_works":["https://openalex.org/W1969015756","https://openalex.org/W12876310","https://openalex.org/W2479872932","https://openalex.org/W2283590027","https://openalex.org/W2031851108","https://openalex.org/W2145692715","https://openalex.org/W3097134347","https://openalex.org/W2964424355","https://openalex.org/W2987086094","https://openalex.org/W2596106487"],"abstract_inverted_index":{"We":[0],"present":[1],"our":[2,34,38],"recent":[3],"effort,":[4],"in":[5,12,17],"the":[6,9,18,30,57,60,81,102,129,134,172,186],"context":[7],"of":[8,20,29,59,74,101,133,149],"caching":[10,106],"systems,":[11],"developing":[13],"a":[14,72,98,113,140],"computer-aided":[15],"approach":[16],"investigation":[19],"information":[21,47],"systems.":[22],"Yeung's":[23],"linear":[24,51,150],"programming":[25],"(LP)":[26],"outer":[27,76,135,164,179],"bound":[28],"entropy":[31,131],"space":[32],"is":[33,53],"starting":[35],"point,":[36],"however":[37],"effort":[39],"goes":[40],"significantly":[41],"beyond":[42],"using":[43],"it":[44],"to":[45,55,97,177],"prove":[46],"inequalities.":[48],"A":[49],"symmetry-reduced":[50],"program":[52],"used":[54],"identify":[56],"boundary":[58],"memory-transmission-rate":[61],"tradeoff":[62,83,104],"for":[63,67,105,116,137,155,181],"several":[64],"simple":[65],"cases,":[66,139,184],"which":[68,90,174],"we":[69,123,160],"can":[70,144,152,166],"obtain":[71],"set":[73],"tight":[75],"bounds.":[77],"General":[78],"hypotheses":[79],"on":[80],"optimal":[82,103],"are":[84,91],"formed":[85],"from":[86],"these":[87],"computed":[88,168],"data,":[89],"then":[92],"analytically":[93],"proved.":[94],"This":[95],"leads":[96],"complete":[99],"characterization":[100,115],"systems":[107,117],"with":[108,118],"only":[109,119],"two":[110,120],"users,":[111],"and":[112,147],"partial":[114],"files.":[121],"Next,":[122],"show":[124,161],"that":[125,162],"by":[126],"carefully":[127],"analyzing":[128],"joint":[130],"structure":[132],"bounds":[136,165,180],"certain":[138],"novel":[141],"code":[142],"construction":[143],"be":[145,153,167],"reverse-engineered,":[146],"unachievability":[148],"codes":[151],"proved":[154],"some":[156],"other":[157],"cases.":[158],"Finally,":[159],"strong":[163],"through":[169],"strategically":[170],"relaxing":[171],"LP,":[173],"allows":[175],"us":[176],"compute":[178],"larger":[182],"problem":[183],"despite":[185],"seemingly":[187],"impossible":[188],"computation":[189],"scale.":[190]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}