{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:26:03Z","timestamp":1783614363102,"version":"3.55.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031263026","type":"print"},{"value":"9783031263033","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-26303-3_26","type":"book-chapter","created":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T16:08:38Z","timestamp":1676045318000},"page":"292-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Online File Caching on\u00a0Multiple Caches in\u00a0Latency-Sensitive Systems"],"prefix":"10.1007","author":[{"given":"Guopeng","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongqiu","family":"Ni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haisheng","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,2,11]]},"reference":[{"key":"26_CR1","unstructured":"Abdi, M., et al.: A community cache with complete information. In: USENIX FAST 2021, pp. 323\u2013340 (2021)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Atre, N., Sherry, J., Wang, W., Berger, D.S.: Caching with delayed hits. In: ACM SIGCOMM (2020)","DOI":"10.1145\/3387514.3405883"},{"key":"26_CR3","unstructured":"Beckmann, N., Chen, H., Cidon, A.: LHD: Improving cache hit rate by maximizing hit density. In: USENIX NSDI (2018)"},{"key":"26_CR4","unstructured":"Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and zipf-like distributions: evidence and implications. In: IEEE INFOCOM\u201999"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Cooper, B.F., Silberstein, A., Tam, E., Ramakrishnan, R., Sears, R.: Benchmarking cloud serving systems with YCSB. In: ACM SoCC (2010)","DOI":"10.1145\/1807128.1807152"},{"issue":"5","key":"26_CR6","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/MIC.2002.1036038","volume":"6","author":"J Dilley","year":"2002","unstructured":"Dilley, J., Maggs, B., Parikh, J., Prokop, H., Sitaraman, R., Weihl, B.: Globally distributed content delivery. IEEE Internet Comput. 6(5), 50\u201358 (2002)","journal-title":"IEEE Internet Comput."},{"issue":"2","key":"26_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00453-013-9793-0","volume":"71","author":"L Epstein","year":"2015","unstructured":"Epstein, L., Imreh, C., Levin, A., Nagy-Gy\u00f6rgy, J.: Online file caching with rejection penalties. Algorithmica 71(2), 279\u2013306 (2015). https:\/\/doi.org\/10.1007\/s00453-013-9793-0","journal-title":"Algorithmica"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Fuerst, A., Sharma, P.: Faascache: keeping serverless computing alive with greedy-dual caching. In: ACM ASPLOS 2021, pp. 386\u2013400 (2021)","DOI":"10.1145\/3410276"},{"key":"26_CR9","unstructured":"Karlsson, M.: Cache memory design trade-offs for current and emerging workloads. Ph.D. thesis, Citeseer (2003)"},{"key":"26_CR10","unstructured":"Liang, Y., et al.: Cachesifter: sifting cache files for boosted mobile performance and lifetime. In: USENIX FAST 2022, pp. 445\u2013459 (2022)"},{"key":"26_CR11","unstructured":"Megiddo, N., Modha, D.S.: Arc: A self-tuning, low overhead replacement cache. In: FAST 2003 (2003)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Pan, L., Wang, L., Chen, S., Liu, F.: Retention-aware container caching for serverless edge computing. In: IEEE INFOCOM 2022 (2022)","DOI":"10.1109\/INFOCOM48880.2022.9796705"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Ramanujam, M., Madhyastha, H.V., Netravali, R.: Marauder: synergized caching and prefetching for low-risk mobile app acceleration. In: MobiSys (2021)","DOI":"10.1145\/3458864.3466866"},{"key":"26_CR14","unstructured":"Reiss, C., Wilkes, J., Hellerstein, J.: Google cluster-usage trace. In: Technical Report (2011)"},{"issue":"2","key":"26_CR15","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Tan, H., Jiang, S.H.C., Han, Z., Liu, L., Han, K., Zhao, Q.: Camul: online caching on multiple caches with relaying and bypassing. In: IEEE INFOCOM (2019)","DOI":"10.1109\/INFOCOM.2019.8737396"},{"key":"26_CR17","unstructured":"Vietri, G., et al.: Driving cache replacement with ML-based LeCaR. In: HotStorage 2018 (2018)"},{"key":"26_CR18","unstructured":"Wang, J., Hu, Y.: Wolf-a novel reordering write buffer to boost the performance of log-structured file system. In: FAST 2002 (2002)"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Wendell, P., Freedman, M.J.: Going viral: flash crowds in an open CDN. In: ACM\/USENIX IMC (2011)","DOI":"10.1145\/2068816.2068867"},{"key":"26_CR20","unstructured":"Yan, G., Li, J.: Towards latency awareness for content delivery network caching. In: USENIX ATC 2022, pp. 789\u2013804 (2022)"},{"issue":"3","key":"26_CR21","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s00453-001-0124-5","volume":"33","author":"NE Young","year":"2002","unstructured":"Young, N.E.: On-line file caching. Algorithmica 33(3), 371\u2013383 (2002). https:\/\/doi.org\/10.1007\/s00453-001-0124-5","journal-title":"Algorithmica"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Yuan, M., Zhang, L., He, F., Tong, X., Li, X.Y.: Infi: end-to-end learnable input filter for resource-efficient mobile-centric inference. In: MobiCom (2022)","DOI":"10.1145\/3495243.3517016"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, C., Tan, H., Li, G., Han, Z., Jiang, S.H.C., Li, X.Y.: Online file caching in latency-sensitive systems with delayed hits and bypassing. In: IEEE INFOCOM 2022, pp. 1059\u20131068. IEEE (2022)","DOI":"10.1109\/INFOCOM48880.2022.9796969"}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26303-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T13:05:20Z","timestamp":1690981520000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26303-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031263026","9783031263033"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26303-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Data and Social Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csonet-conf.github.io\/csonet22\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}