{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:22:42Z","timestamp":1761402162792,"version":"3.41.0"},"reference-count":3,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T00:00:00Z","timestamp":1614902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2021,3,5]]},"abstract":"<jats:p>We study fair content allocation strategies in caching networks through a utility-driven framework, where each request achieves a utility of its caching gain rate. The resulting problem is NP-hard. Submodularity allows us to devise a deterministic allocation strategy with an optimality guarantee factor arbitrarily close to 1-1\/e. When 0 &lt; \u03b1 \u2264 1, we further propose a randomized strategy that attains an improved optimality guarantee, (1 - 1\/e)1-\u03b1, in expectation. Through extensive simulations over synthetic and real-world network topologies, we evaluate the performance of our proposed strategies and discuss the effect of fairness.<\/jats:p>","DOI":"10.1145\/3453953.3453973","type":"journal-article","created":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T04:12:32Z","timestamp":1615003952000},"page":"89-90","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Fair Caching Networks"],"prefix":"10.1145","volume":"48","author":[{"given":"Yuezhou","family":"Liu","sequence":"first","affiliation":[{"name":"Northeastern University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanyuan","family":"Li","sequence":"additional","affiliation":[{"name":"Northeastern University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Ma","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stratis","family":"Ioannidis","sequence":"additional","affiliation":[{"name":"Northeastern Universit"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edmund","family":"Yeh","sequence":"additional","affiliation":[{"name":"Northeastern University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,3,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901467"},{"key":"e_1_2_1_2_1","first-page":"10","article-title":"Fair caching networks","author":"Liu Y.","year":"2020","unstructured":"Y. Liu , Y. Li , Q. Ma , S. Ioannidis , and E. Yeh , \" Fair caching networks ,\" Performance Evaluation , 2020 . https:\/\/doi.org\/ 10 .1016\/j.peva.2020.102138. 10.1016\/j.peva.2020.102138 Y. Liu, Y. Li, Q. Ma, S. Ioannidis, and E. Yeh, \"Fair caching networks,\" Performance Evaluation, 2020. https:\/\/doi.org\/10.1016\/j.peva.2020.102138.","journal-title":"Performance Evaluation"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038913.96607.c2"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453953.3453973","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3453953.3453973","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:51Z","timestamp":1750193271000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453953.3453973"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,5]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3,5]]}},"alternative-id":["10.1145\/3453953.3453973"],"URL":"https:\/\/doi.org\/10.1145\/3453953.3453973","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2021,3,5]]},"assertion":[{"value":"2021-03-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}