{"id":"https://openalex.org/W7084029680","doi":"https://doi.org/10.1109/infocom55648.2025.11044511","title":"Latency Guarantees for Caching with Delayed Hits","display_name":"Latency Guarantees for Caching with Delayed Hits","publication_year":2025,"publication_date":"2025-05-19","ids":{"openalex":"https://openalex.org/W7084029680","doi":"https://doi.org/10.1109/infocom55648.2025.11044511"},"language":"en","primary_location":{"id":"doi:10.1109/infocom55648.2025.11044511","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom55648.2025.11044511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2025 - IEEE Conference on Computer Communications","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":null,"display_name":"Keerthana Gurushankar","orcid":"https://orcid.org/0009-0004-4350-6906"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Keerthana Gurushankar","raw_affiliation_strings":["Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA"],"raw_orcid":"https://orcid.org/0009-0004-4350-6906","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Noah G. Singer","orcid":"https://orcid.org/0000-0002-0076-521X"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Noah G. Singer","raw_affiliation_strings":["Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA"],"raw_orcid":"https://orcid.org/0000-0002-0076-521X","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":null,"display_name":"Bernardo Subercaseaux","orcid":"https://orcid.org/0000-0003-2295-1299"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bernardo Subercaseaux","raw_affiliation_strings":["Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA"],"raw_orcid":"https://orcid.org/0000-0003-2295-1299","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":50.8508,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.99771764,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T14388","display_name":"Medieval European History and Architecture","score":0.10689999908208847,"subfield":{"id":"https://openalex.org/subfields/1204","display_name":"Archeology"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T14388","display_name":"Medieval European History and Architecture","score":0.10689999908208847,"subfield":{"id":"https://openalex.org/subfields/1204","display_name":"Archeology"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T14339","display_name":"Image Processing and 3D Reconstruction","score":0.0568000003695488,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12886","display_name":"Historical and Cultural Studies of Poland","score":0.035599999129772186,"subfield":{"id":"https://openalex.org/subfields/1202","display_name":"History"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.8360999822616577},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.7858999967575073},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.5800999999046326},{"id":"https://openalex.org/keywords/smart-cache","display_name":"Smart Cache","score":0.5638999938964844},{"id":"https://openalex.org/keywords/cache-invalidation","display_name":"Cache invalidation","score":0.48750001192092896},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.46560001373291016}],"concepts":[{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.8360999822616577},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8299999833106995},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.7858999967575073},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.5800999999046326},{"id":"https://openalex.org/C167713795","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"Smart Cache","level":5,"score":0.5638999938964844},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5170000195503235},{"id":"https://openalex.org/C25536678","wikidata":"https://www.wikidata.org/wiki/Q5015977","display_name":"Cache invalidation","level":5,"score":0.48750001192092896},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.46560001373291016},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.44620001316070557},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.3668999969959259},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.36039999127388},{"id":"https://openalex.org/C2986847828","wikidata":"https://www.wikidata.org/wiki/Q269415","display_name":"Content delivery","level":2,"score":0.3375999927520752},{"id":"https://openalex.org/C3017552255","wikidata":"https://www.wikidata.org/wiki/Q4135208","display_name":"Arrival time","level":2,"score":0.3140000104904175},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.29660001397132874},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.289900004863739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2897999882698059},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.2849999964237213},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom55648.2025.11044511","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom55648.2025.11044511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2025 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5481085895","display_name":null,"funder_award_id":"1942124,2140739,DMS-2434625","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"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":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,13,24,28,31,63,71,75,84,87,90,94,101,124,128,140,172],"classical":[2,106],"caching":[3,109],"problem,":[4],"when":[5],"a":[6,16,66,154],"requested":[7],"page":[8],"is":[9,19,47,121],"not":[10],"present":[11,139],"in":[12,36,97,105,161],"cache":[14,29,68,102],"(i.e.,":[15],"\u201cmiss\u201d),":[17],"it":[18,165],"assumed":[20],"to":[21,179],"travel":[22],"from":[23,74],"backing":[25,76],"store":[26],"into":[27],"before":[30],"next":[32],"request":[33,69],"arrives.":[34],"However,":[35],"many":[37],"real-life":[38],"applications,":[39],"such":[40],"as":[41,104],"content":[42],"delivery":[43],"networks,":[44],"this":[45],"assumption":[46],"unrealistic.":[48],"The":[49,149],"delayed-hits":[50,129,147],"model":[51,80],"for":[52,62,145],"caching,":[53],"introduced":[54],"by":[55],"Atre,":[56],"Sherry,":[57],"Wang,":[58],"and":[59,70,93,100],"Berger,":[60],"accounts":[61],"latency":[64,170],"between":[65,89],"missed":[67,119],"corresponding":[72],"arrival":[73],"store.":[77],"This":[78],"theoretical":[79,132,143],"has":[81],"two":[82],"parameters:":[83],"delay$Z$,":[85],"representing":[86],"ratio":[88],"retrieval":[91],"delay":[92,96],"inter-request":[95],"an":[98],"application,":[99],"size$k$,":[103],"caching.":[107],"Classical":[108],"corresponds":[110],"to$Z=1$,":[111],"whereas":[112],"larger":[113],"values":[114],"of$Z$model":[115],"applications":[116],"where":[117],"retrieving":[118],"requests":[120],"expensive.":[122],"Despite":[123],"practical":[125],"relevance":[126],"of":[127],"model,":[130],"its":[131],"underpinnings":[133],"are":[134],"still":[135],"poorly":[136],"understood.":[137],"We":[138],"first":[141],"tight":[142],"guarantee":[144],"optimizing":[146],"caching:":[148],"\u201cLeast":[150],"Recently":[151],"Used\u201d":[152],"algorithm,":[153],"natural,":[155],"deterministic,":[156],"online":[157],"algorithm":[158],"widely":[159],"used":[160],"practice,":[162],"is$O(Zk)$-competitive,":[163],"meaning":[164],"incurs":[166],"at":[167],"most$O(Zk)$times":[168],"more":[169],"than":[171],"(offline)":[173],"optimal":[174],"schedule.":[175],"Our":[176],"result":[177],"extends":[178],"any":[180],"so-called":[181],"\u201cmarking\u201d":[182],"algorithm.":[183]},"counts_by_year":[{"year":2026,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}