{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:38:39Z","timestamp":1767339519697,"version":"3.37.3"},"reference-count":61,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Open J. Commun. Soc."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/ojcoms.2021.3068222","type":"journal-article","created":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T20:33:05Z","timestamp":1616531585000},"page":"656-670","source":"Crossref","is-referenced-by-count":4,"title":["Tomography Based Learning for Load Distribution Through Opaque Networks"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9434-8440","authenticated-orcid":false,"given":"Shenghe","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murali","family":"Kodialam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. V.","family":"Lakshman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9822-6838","authenticated-orcid":false,"given":"Shivendra S.","family":"Panwar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486020"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230551"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/IC2E.2014.24"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2491700"},{"key":"ref31","first-page":"904","article-title":"MiceTrap: Scalable traffic engineering of datacenter mice flows using openflow","author":"trestian","year":"2013","journal-title":"Proc IFIP\/IEEE Int Symp Integr Netw Manage"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2079296.2079304"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3152434.3152441"},{"key":"ref36","first-page":"671","article-title":"Packet routing in dynamically changing networks: A reinforcement learning approach","author":"boyan","year":"1994","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3359989.3365430"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098853"},{"key":"ref60","first-page":"1","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2015","journal-title":"Proc 3rd Int Conf Learn Represent (ICLR)"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2019.8886140"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018466"},{"key":"ref27","first-page":"89","article-title":"HEDERA: Dynamic flow scheduling for data center networks","volume":"10","author":"al-fares","year":"2010","journal-title":"Proc NSDI"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934956"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1730836.1730863"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3127589"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/S026996481600036X"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2964200"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2884653"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/65.826367"},{"key":"ref23","first-page":"1","article-title":"Continuous control with deep reinforcement learning","author":"lillicrap","year":"2016","journal-title":"Proc ICLR"},{"key":"ref26","first-page":"28","article-title":"Traffic engineering in software defined networks: A survey","volume":"14","author":"abbasi","year":"2000","journal-title":"J Telecommun Inf Technol"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039866"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2017.12.004"},{"key":"ref51","first-page":"427","article-title":"Revisiting Frank–Wolfe: Projection-free sparse convex optimization","author":"jaggi","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref59","first-page":"1","article-title":"Taming the noise in reinforcement learning via soft updates","author":"fox","year":"2016","journal-title":"Proc 32nd Conf Uncertainty Artif Intell (UAI)"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/1096536.1096551"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2677202"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2018.2889337"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2853708"},{"key":"ref54","volume":"2","author":"bertsekas","year":"1992","journal-title":"Data Networks"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.822655"},{"key":"ref52","first-page":"1","article-title":"Stochastic conditional gradient methods: From convex minimization to submodular maximization","volume":"21","author":"mokhtari","year":"2020","journal-title":"J Mach Learn Res"},{"key":"ref10","first-page":"1","article-title":"Aster*X: Load-balancing as a network primitive","author":"handigol","year":"2010","journal-title":"Proc 9th GENI Eng Conf (Plenary)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2015.7417124"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2835758"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787496"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref14","volume":"7","author":"altman","year":"1999","journal-title":"Constrained Markov Decision Processes"},{"key":"ref15","first-page":"22","article-title":"Constrained policy optimization","volume":"70","author":"achiam","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref16","first-page":"1","article-title":"Reward constrained policy optimization","author":"tessler","year":"2018","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref17","first-page":"3703","article-title":"Batch policy learning under constraints","volume":"97","author":"le","year":"2019","journal-title":"Mach Learn Res"},{"key":"ref18","first-page":"14093","article-title":"Reinforcement learning with convex constraints","author":"miryoosefi","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref19","first-page":"1","article-title":"Multi-armed bandit with budget constraint and variable costs","volume":"27","author":"ding","year":"2013","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/885651.781053","article-title":"Fast accurate computation of large-scale ip traffic matrices from link loads","volume":"31","author":"zhang","year":"2003","journal-title":"ACM SIGMETRICS Perform Eval Rev"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/2291416"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.796384"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.893227"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.880182"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948233"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/511399.511338"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485853"},{"journal-title":"A Deep-Reinforcement Learning Approach for Software-Defined Networking Routing Optimization","year":"2017","author":"stampa","key":"ref45"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637242"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836091"},{"key":"ref42","first-page":"3050","article-title":"A deep reinforcement learning perspective on Internet congestion control","author":"jay","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2892046"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2916583"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098843"}],"container-title":["IEEE Open Journal of the Communications Society"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8782661\/9309127\/09383827.pdf?arnumber=9383827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T18:33:48Z","timestamp":1643222028000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9383827\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":61,"URL":"https:\/\/doi.org\/10.1109\/ojcoms.2021.3068222","relation":{},"ISSN":["2644-125X"],"issn-type":[{"type":"electronic","value":"2644-125X"}],"subject":[],"published":{"date-parts":[[2021]]}}}