{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T17:06:47Z","timestamp":1781284007132,"version":"3.54.1"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"MoE-CMCC Artificial Intelligence","award":["MCM20190701"],"award-info":[{"award-number":["MCM20190701"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Mobile Comput."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1109\/tmc.2024.3379191","type":"journal-article","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T18:38:20Z","timestamp":1710873500000},"page":"10628-10646","source":"Crossref","is-referenced-by-count":21,"title":["Scalable QoS-Aware Multipath Routing in Hybrid Knowledge-Defined Networking With Multiagent Deep Reinforcement Learning"],"prefix":"10.1109","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6897-5531","authenticated-orcid":false,"given":"Yang","family":"Xiao","sequence":"first","affiliation":[{"name":"Intelligent Perception and Computing Research Center, School of Artificial Intelligence, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9434-5760","authenticated-orcid":false,"given":"Ying","family":"Yang","sequence":"additional","affiliation":[{"name":"Intelligent Perception and Computing Research Center, School of Artificial Intelligence, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5240-722X","authenticated-orcid":false,"given":"Huihan","family":"Yu","sequence":"additional","affiliation":[{"name":"Intelligent Perception and Computing Research Center, School of Artificial Intelligence, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4007-6109","authenticated-orcid":false,"given":"Jun","family":"Liu","sequence":"additional","affiliation":[{"name":"Intelligent Perception and Computing Research Center, School of Artificial Intelligence, Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2017.1600304WC"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.001.1900287"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.013.2100087"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.001.1900508"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3073009"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2348176"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3035761"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2006.79"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2460222"},{"key":"ref10","first-page":"1","article-title":"Analysis of an equal-cost multi-path algorithm","volume":"2992","author":"Hopps","year":"2000","journal-title":"RFC"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.082511.00013"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3007842"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3167098"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737398"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2906742"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3051995"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2633579"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2837161"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3138808.3138810"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2023.3235446"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.1800157"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2916583"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1126\/science.aar6404"},{"key":"ref24","article-title":"GPT-4 technical report","year":"2023"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3102580"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485853"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.3017751"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3000371"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2933968"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM48099.2022.10000597"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3063822"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488736"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3233853"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3120050"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3589010.3594888"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9322277"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3070584"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CCNC49033.2022.9700657"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018466"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2008.4476066"},{"key":"ref41","article-title":"OSPF optimized multipath (OSPF-OMP)","author":"Villamizar"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2005.01.011"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2006.875032"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844999"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.902546"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/NFV-SDN53031.2021.9665119"},{"key":"ref47","first-page":"117","article-title":"The design and implementation of open vSwitch","volume-title":"Proc. 12th USENIX Symp. Netw. Syst. Des. Implementation","author":"Pfaff"},{"key":"ref48","volume-title":"RESTful Web Services","author":"Richardson","year":"2008"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2326417"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2321898"},{"key":"ref51","first-page":"14118","article-title":"Calibration of shared equilibria in general sum partially observable Markov games","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Vadori"},{"key":"ref52","first-page":"16509","article-title":"Multi-agent reinforcement learning is a sequence modeling problem","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wen"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4054-9"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3450494"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3042508"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"ref57","first-page":"1531","article-title":"A natural policy gradient","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Kakade"},{"key":"ref58","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"key":"ref59","first-page":"8024","article-title":"PyTorch: An imperative style, high-performance deep learning library","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Paszke"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.25080\/tcwv9851"},{"key":"ref61","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014"},{"key":"ref62","first-page":"1587","article-title":"Addressing function approximation error in actor-critic methods","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Fujimoto"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2023.3333848"}],"container-title":["IEEE Transactions on Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7755\/10704790\/10475545.pdf?arnumber=10475545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T04:15:53Z","timestamp":1728015353000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10475545\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":63,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tmc.2024.3379191","relation":{},"ISSN":["1536-1233","1558-0660","2161-9875"],"issn-type":[{"value":"1536-1233","type":"print"},{"value":"1558-0660","type":"electronic"},{"value":"2161-9875","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11]]}}}