{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T08:02:59Z","timestamp":1771488179231,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF Awards","doi-asserted-by":"publisher","award":["1908574"],"award-info":[{"award-number":["1908574"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF Awards","doi-asserted-by":"publisher","award":["2201536"],"award-info":[{"award-number":["2201536"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Serv. Manage."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1109\/tnsm.2023.3287936","type":"journal-article","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T17:29:26Z","timestamp":1687282166000},"page":"2283-2294","source":"Crossref","is-referenced-by-count":22,"title":["Dealing With Changes: Resilient Routing via Graph Neural Networks and Multi-Agent Deep Reinforcement Learning"],"prefix":"10.1109","volume":"20","author":[{"given":"Sai Shreyas","family":"Bhavanasi","sequence":"first","affiliation":[{"name":"Department of Computer Science, Saint Louis University, St. Louis, MO, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1894-3173","authenticated-orcid":false,"given":"Lorenzo","family":"Pappone","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Saint Louis University, St. Louis, MO, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-4584","authenticated-orcid":false,"given":"Flavio","family":"Esposito","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Saint Louis University, St. Louis, MO, USA"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761737"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2018.1800097"},{"key":"ref34","author":"bhavanasi","year":"2023","journal-title":"Packet routing using multi agent DQN and single agent GCN"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3041385"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2881964"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM46510.2021.9685941"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3309697.3331501"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2010.111910.091238"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2159844"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098853"},{"key":"ref1","article-title":"Playing Atari with deep reinforcement learning","author":"mnih","year":"2013","journal-title":"arXiv 1312 5602"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2020.3012832"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN48605.2020.9206767"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCA51439.2020.9264518"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2904539"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2001.948886"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1038\/nature14236","article-title":"Human-level control through deep reinforcement learning","volume":"518","author":"mnih","year":"2015","journal-title":"Nature"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISSNIP.2007.4496810"},{"key":"ref25","author":"mitchell","year":"1997","journal-title":"Machine Learning International Edition"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2019.8845154"},{"key":"ref22","article-title":"Deep convolutional networks on graph-structured data","author":"henaff","year":"2015","journal-title":"arXiv 1506 05163"},{"key":"ref21","article-title":"Proximal policy optimization algorithms","author":"schulman","year":"2017","journal-title":"arXiv 1707 06347"},{"key":"ref28","first-page":"1995","article-title":"Dueling network architectures for deep reinforcement learning","author":"wang","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref27","first-page":"2613","article-title":"Double Q-learning","volume":"23","author":"van hasselt","year":"2010","journal-title":"Proc Int Conf Adv Neural Inf Process Syst"},{"key":"ref29","first-page":"1","article-title":"A machine learning approach to routing","author":"valadarsky","year":"2017","journal-title":"Proc 31st Conf Neural Inf Process Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2913776"},{"key":"ref7","first-page":"945","article-title":"Predictive Q-routing: A memory-based reinforcement learning approach to adaptive traffic control","author":"choi","year":"1996","journal-title":"Proc Int Conf Adv Neural Inf Process Syst"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SCC.2016.12"},{"key":"ref4","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2017","journal-title":"Proc 5th Int Conf Learn Represent"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.1999.801912"},{"key":"ref6","first-page":"55","article-title":"A distributed reinforcement learning scheme for network routing","author":"littman","year":"2013","journal-title":"Proc Int Workshop Appl Neural Netw Telecommun"},{"key":"ref5","first-page":"671","article-title":"Packet routing in dynamically changing networks: A reinforcement learning approach","author":"boyan","year":"1994","journal-title":"Proc Int Conf Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Network and Service Management"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/4275028\/10274602\/10158424-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4275028\/10274602\/10158424.pdf?arnumber=10158424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T19:10:15Z","timestamp":1698693015000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10158424\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9]]},"references-count":34,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnsm.2023.3287936","relation":{},"ISSN":["1932-4537","2373-7379"],"issn-type":[{"value":"1932-4537","type":"electronic"},{"value":"2373-7379","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9]]}}}