{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:08:13Z","timestamp":1740100093343,"version":"3.37.3"},"reference-count":50,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,5,10]]},"DOI":"10.1109\/infocom42981.2021.9488715","type":"proceedings-article","created":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T00:07:32Z","timestamp":1627344452000},"page":"1-10","source":"Crossref","is-referenced-by-count":8,"title":["Rate Allocation and Content Placement in Cache Networks"],"prefix":"10.1109","author":[{"given":"Khashayar","family":"Kamran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armin","family":"Moharrer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stratis","family":"Ioannidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edmund","family":"Yeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"486","article-title":"Continuous dr-submodular maximization: Structure and algorithms","author":"bian","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2013.6733576"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2012.6193514"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658941"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3152042.3152050"},{"article-title":"A ttl-based approach for content placement in edge networks","year":"2017","author":"panigrahy","key":"ref30"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/LANMAN.2016.7548848"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2660129.2660145"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2984356.2984365"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2016.04.017"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901459"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848145"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2913677"},{"journal-title":"The Mathematics of Internet Congestion Control","year":"2012","author":"srikant","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/sj.jors.2600523"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737377"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218465"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155416"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8422990"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2660129.2660151"},{"key":"ref26","first-page":"1","article-title":"A versatile and accurate approximation for lru cache performance","author":"fricker","year":"2012","journal-title":"ITC"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.801752"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480192243516"},{"key":"ref10","first-page":"158","article-title":"Named data networking (ndn) project","volume":"157","author":"zhang","year":"2010","journal-title":"Relatório Técnico NDN-0001 Xerox Palo Alto Research Center-PARC"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3323679.3326509"},{"article-title":"Submodular cost submodular cover with an approximate oracle","year":"2019","author":"crawford","key":"ref40"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2865171"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2018.1700202"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3154273.3154347"},{"key":"ref15","first-page":"277","article-title":"Mapreduce for data intensive scientific analyses","author":"ekanayake","year":"2008","journal-title":"IEEE Fourth International Conference on EScience"},{"key":"ref16","first-page":"111","article-title":"Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains","volume":"54","author":"bian","year":"2017","journal-title":"Proceedings of the 20th International Conference on Artificial Intelligence and Statistics"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/080715421"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109624"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/90.811451"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/90.879343"},{"key":"ref6","first-page":"1","article-title":"Analysis of TTL-based cache networks","author":"fofack","year":"2012","journal-title":"6th International ICST Conference on Performance Evaluation Methodologies and Tools VALUETOOLS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461936"},{"key":"ref8","first-page":"1","article-title":"The future of networking, and the past of protocols","volume":"20","author":"shenker","year":"2011","journal-title":"Open Networking Summit"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901467"},{"key":"ref49","first-page":"6853","article-title":"Stochastic submodular maximization: The case of coverage functions","author":"karimi","year":"2017","journal-title":"NeurIPS"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/MCOM.2015.7045396","article-title":"Network function virtualization: Challenges and opportunities for innovations","volume":"53","author":"han","year":"2015","journal-title":"IEEE Communications Magazine"},{"journal-title":"Constrained Optimization and Lagrange Multiplier Methods","year":"1982","author":"bertsekas","key":"ref46"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/0725029"},{"journal-title":"Nonlinear Programming","year":"1999","author":"bertsekas","key":"ref48"},{"key":"ref47","volume":"2","author":"fletcher","year":"1981","journal-title":"Practical Methods of Optimization"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7248843"},{"key":"ref41","first-page":"2436","article-title":"Submodular optimization with submodular cover and submodular knapsack constraints","author":"iyer","year":"2013","journal-title":"NeurIPS"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-97-00777-1"},{"key":"ref43","doi-asserted-by":"crossref","DOI":"10.1109\/INFOCOM42981.2021.9488715","article-title":"Rate allocation and content placement in cache networks","author":"kamran","year":"2021"}],"event":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications","start":{"date-parts":[[2021,5,10]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2021,5,13]]}},"container-title":["IEEE INFOCOM 2021 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9488422\/9488423\/09488715.pdf?arnumber=9488715","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T15:21:44Z","timestamp":1672932104000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9488715\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,10]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/infocom42981.2021.9488715","relation":{},"subject":[],"published":{"date-parts":[[2021,5,10]]}}}