{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T07:32:11Z","timestamp":1768289531149,"version":"3.49.0"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62371057"],"award-info":[{"award-number":["62371057"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Mobile Comput."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1109\/tmc.2025.3607388","type":"journal-article","created":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T17:49:20Z","timestamp":1757353760000},"page":"2528-2545","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Sacrifice for QoS-Aware Routing: A Graph Reinforcement Learning Approach"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8495-3487","authenticated-orcid":false,"given":"Yuqian","family":"Song","sequence":"first","affiliation":[{"name":"Intelligent Perception and Computing Research Center, School of Artificial Intelligence, Beijing University of Posts and Telecommunications (BUPT), Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7775-7154","authenticated-orcid":false,"given":"Jingli","family":"Zhou","sequence":"additional","affiliation":[{"name":"Intelligent Perception and Computing Research Center, School of Artificial Intelligence, Beijing University of Posts and Telecommunications (BUPT), Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shudan","family":"Yu","sequence":"additional","affiliation":[{"name":"China Mobile Communications Corporation, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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 (BUPT), Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2475"},{"key":"ref2","first-page":"11","article-title":"Supporting differentiated service classes: Queue scheduling disciplines","author":"Semeria","year":"2001","journal-title":"Juniper Netw."},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.751451"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2883147"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656890"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3000405"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2022.04.006"},{"key":"ref9","first-page":"671","article-title":"Packet routing in dynamically changing networks: A reinforcement learning approach","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Boyan"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3000371"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3191337"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3207346"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485853"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488736"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2021.3077249"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2024.3379191"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2021.3132491"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228875"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM46510.2021.9685941"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.3017751"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3533378"},{"key":"ref22","article-title":"ACCNet: Actor-coordinator-critic Net for \u2018learning-to-communicate\u2019 with deep multi-agent reinforcement learning","author":"Mao","year":"2017"},{"key":"ref23","article-title":"Learning multi-agent communication under limited-bandwidth restriction for Internet packet routing","author":"Mao","year":"2019"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/214"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.123.2100773"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/icnp49622.2020.9259413"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOMWKSHPS50562.2020.9162984"},{"key":"ref28","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref29","article-title":"Spectral networks and locally connected networks on graphs","author":"Bruna","year":"2014"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS51616.2021.00056"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2022.09.029"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2960033"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3188826"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.09.051"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BF02854581"},{"key":"ref36","article-title":"Line graphs and line digraphs","volume-title":"Selected Topics in Graph Theory","author":"Hemminger","year":"1983"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81386-4"},{"key":"ref38","article-title":"Reward design in cooperative multi-agent reinforcement learning for packet routing","author":"Mao","year":"2020"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.04.014"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2877686"},{"key":"ref41","article-title":"Graph convolutional reinforcement learning","author":"Jiang","year":"2018"},{"key":"ref42","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"key":"ref43","article-title":"Feudal multi-agent hierarchies for cooperative reinforcement learning","author":"Ahilan","year":"2019"},{"key":"ref44","article-title":"Parameter sharing deep deterministic policy gradient for cooperative multi-agent reinforcement learning","author":"Chu","year":"2017"},{"key":"ref45","first-page":"1","article-title":"Discrete event simulation system","volume-title":"Proc. Eur. Simul. Multiconference","author":"Varga"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12842-5_2"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3455008"},{"key":"ref48","article-title":"Fast graph representation learning with PyTorch geometric","author":"Fey","year":"2019"},{"key":"ref49","volume-title":"ZeroMQ: Messaging for Many Applications","author":"Hintjens","year":"2013"},{"key":"ref50","article-title":"Adam:A method for stochastic optimization","author":"Kingma","year":"2014"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.23919\/CNSM62983.2024.10814515"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2992"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2328"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"}],"container-title":["IEEE Transactions on Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7755\/11345503\/11153706.pdf?arnumber=11153706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T23:58:58Z","timestamp":1768262338000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11153706\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":54,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tmc.2025.3607388","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":[[2026,2]]}}}