{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T14:01:55Z","timestamp":1762956115558,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1109\/tnet.2019.2926235","type":"journal-article","created":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T19:48:16Z","timestamp":1563479296000},"page":"1657-1668","source":"Crossref","is-referenced-by-count":2,"title":["Asymptotics of Replication and Matching in Large Caching Systems"],"prefix":"10.1109","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0634-1389","authenticated-orcid":false,"given":"Arpan","family":"Mukhopadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7385-3416","authenticated-orcid":false,"given":"Nidhi","family":"Hegde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Lelarge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1870178.1870189"},{"key":"ref32","article-title":"Insensitivity of the mean-field limit of loss systems under power-of-d routing","author":"vasantam","year":"2017","journal-title":"arXiv 1708 09328"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2015.06.008"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901463"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2012.07.003"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0103843"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218465"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844999"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2014.6952688"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2577199"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844939"},{"key":"ref16","article-title":"Content replication in large distributed caches","author":"moharir","year":"2016","journal-title":"arXiv 1603 09153"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"ref18","article-title":"Greedy online bipartite matching on random graphs","author":"mastin","year":"2013","journal-title":"arXiv 1307 2536"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/apr.2016.79"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1287\/15-SSY179"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005872"},{"article-title":"The power of two choices in randomized load balancing","year":"1996","author":"mitzenmacher","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2002.1036038"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2754419"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195644"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2318857.2254764"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2208199"},{"journal-title":"Cisco Visual Networking Index Forecast and Methodology 2016–2021","year":"2017","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.132"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486229"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2637364.2591978"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.1.97"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499363220"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70322-4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-014-9582-4"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.2307\/3212147"},{"key":"ref25","first-page":"120","author":"hausmann","year":"1980","journal-title":"Worst Case Analysis Of Greedy Type Algorithms For Independence Systems"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8804282\/08765771.pdf?arnumber=8765771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:14:52Z","timestamp":1657746892000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8765771\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":35,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2019.2926235","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}