{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T06:59:49Z","timestamp":1772521189430,"version":"3.50.1"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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 Trans. Netw."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/ton.2026.3662995","type":"journal-article","created":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T21:03:57Z","timestamp":1770671037000},"page":"3580-3595","source":"Crossref","is-referenced-by-count":0,"title":["Congestion-Aware Routing and Content Placement in Elastic Cache Networks"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-7129-9291","authenticated-orcid":false,"given":"Jinkun","family":"Zhang","sequence":"first","affiliation":[{"name":"Department of Electrical and Electronic Engineering, Imperial College London, London, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edmund","family":"Yeh","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering Department, Northeastern University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093711"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2545655"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2793581"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3125719.3125730"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2636843"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461964"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2514418"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2012.6231276"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656887"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.1990.204000"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2660129.2660151"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8422990"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNC.2019.8685587"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3390\/fi13050131"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3056503"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2866947"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844638"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2016.7511288"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2569420"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2013.03.002"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2017.11.009"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2913677"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836093"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488694"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2980105"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2023.3235480"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3061685"},{"key":"ref30","first-page":"37626","article-title":"From linear to linearizable optimization: A novel framework with applications to stationary and non-stationary DR-submodular optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"37","author":"Pedramfar"},{"key":"ref31","first-page":"11577","article-title":"Submodular+ concave","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Mitra"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.801752"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/346000.346003"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2982863"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316231"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2342488.2342500"},{"issue":"5","key":"ref38","doi-asserted-by":"crossref","first-page":"4118","DOI":"10.1109\/TMC.2024.3521247","article-title":"Adaptive joint routing and caching in knowledge-defined networking: An actor-critic deep reinforcement learning approach","volume":"24","author":"Xiao","year":"2025","journal-title":"IEEE Trans. Mobile Comput."},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM55648.2025.11044457"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.23919\/WIOPT.2018.8362806"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2017.2724547"},{"issue":"12","key":"ref42","doi-asserted-by":"crossref","first-page":"2449","DOI":"10.1109\/TPDS.2024.3475412","article-title":"Competitive analysis of online elastic caching of transient data in multi-tiered content delivery network","volume":"35","author":"Wu","year":"2024","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref43","volume-title":"Data Networks","author":"Bertsekas","year":"2021"},{"key":"ref44","first-page":"111","article-title":"Guaranteed non-convex optimization: Submodular maximization over continuous domains","author":"Bian","year":"2017","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.23919\/WiOpt56218.2022.9930581"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038913.96607.c2"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.60"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3136157"},{"key":"ref50","first-page":"1","article-title":"Caching performance of content centric networks under multi-path routing (and more)","volume":"2011","author":"Rossi","year":"2011","journal-title":"Relat\u00f3rio T\u00e9cnico"},{"key":"ref51","volume-title":"Wikimedia Pageviews Dumps","year":"2025"},{"key":"ref52","first-page":"644","article-title":"Optimal continuous DR-submodular maximization and applications to provable mean field inference","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bian"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928299"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1038\/sj.jors.2600425"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096159"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/11317935\/11386931.pdf?arnumber=11386931","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T06:21:17Z","timestamp":1772518877000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11386931\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/ton.2026.3662995","relation":{},"ISSN":["2998-4157"],"issn-type":[{"value":"2998-4157","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}