{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T06:09:15Z","timestamp":1730268555790,"version":"3.28.0"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"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":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/infocom.2019.8737377","type":"proceedings-article","created":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T20:35:56Z","timestamp":1560803756000},"page":"217-225","source":"Crossref","is-referenced-by-count":14,"title":["Kelly Cache Networks"],"prefix":"10.1109","author":[{"given":"Milad","family":"Mahdian","sequence":"first","affiliation":[]},{"given":"Armin","family":"Moharrer","sequence":"additional","affiliation":[]},{"given":"Stratis","family":"Ioannidis","sequence":"additional","affiliation":[]},{"given":"Edmund","family":"Yeh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","article-title":"Maximizing a submodular set function subject to a matroid constraint","author":"calinescu","year":"2007","journal-title":"IPCO"},{"key":"ref32","volume":"2","author":"bertsekas","year":"1992","journal-title":"Data Networks"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1287\/moor.3.3.177"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374389"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.60"},{"key":"ref10","article-title":"On the complexity of optimal routing and content caching in heterogeneous networks","author":"dehghan","year":"2014","journal-title":"INFOCOM"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/PCCC.2004.1395054"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.801752"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2785971.2785975"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2013.6831621"},{"key":"ref17","article-title":"Search and replication in unstructured peer-to-peer networks","author":"lv","year":"2002","journal-title":"ICS"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633043"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737377"},{"key":"ref28","article-title":"Revisiting the greedy approach to submodular set function maximization","author":"goundan","year":"2007","journal-title":"Optimization Online"},{"journal-title":"Probability Stochastic Processes and Queueing Theory The Mathematics of Computer Performance Modeling","year":"2010","author":"nelson","key":"ref4"},{"key":"ref27","article-title":"Submodular function maximization","author":"krause","year":"2012","journal-title":"Tractability Practical Approaches to Hard Problems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139626514"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658941"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref5","volume":"46","author":"chen","year":"2013","journal-title":"Fundamentals of Queueing Networks Performance Asymptotics and Optimization"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901467"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2660129.2660151"},{"journal-title":"Reversibility and Stochastic Networks","year":"2011","author":"kelly","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461964"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3125719.3125730"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038913.96607.c2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1073"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/080715421"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921174"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109624"}],"event":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","start":{"date-parts":[[2019,4,29]]},"location":"Paris, France","end":{"date-parts":[[2019,5,2]]}},"container-title":["IEEE INFOCOM 2019 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8732929\/8737365\/08737377.pdf?arnumber=8737377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T23:08:49Z","timestamp":1657840129000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8737377\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/infocom.2019.8737377","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}