{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:15:57Z","timestamp":1780053357227,"version":"3.54.0"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Mitacs\/Ultra Intelligence and Communications","award":["IT25839"],"award-info":[{"award-number":["IT25839"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3569236","type":"journal-article","created":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T17:45:14Z","timestamp":1747071914000},"page":"85447-85460","source":"Crossref","is-referenced-by-count":5,"title":["New Approaches for Network Topology Optimization Using Deep Reinforcement Learning and Graph Neural Network"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5770-1631","authenticated-orcid":false,"given":"Mohammed","family":"Ali","sequence":"first","affiliation":[{"name":"École de Technologie Supérieure, Montreal, QC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florent","family":"Duchesne","sequence":"additional","affiliation":[{"name":"École de Technologie Supérieure, Montreal, QC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9681-5655","authenticated-orcid":false,"given":"Ghassan","family":"Dahman","sequence":"additional","affiliation":[{"name":"École de Technologie Supérieure, Montreal, QC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4558-3401","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Gagnon","sequence":"additional","affiliation":[{"name":"École de Technologie Supérieure, Montreal, QC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5313-9378","authenticated-orcid":false,"given":"Diala","family":"Naboulsi","sequence":"additional","affiliation":[{"name":"École de Technologie Supérieure, Montreal, QC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/jlt.2019.2923615"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP52444.2021.9651930"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/infcomw.2019.8845132"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/jstqe.2022.3151323"},{"key":"ref5","first-page":"1","article-title":"Microservice-based unsupervised anomaly detection loop for optical networks","volume-title":"Proc. Opt. Fiber Commun. Conf. Exhib. (OFC)","author":"Natalino"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/icin53892.2022.9758091"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6710063"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CADSM.2019.8779298"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3023452"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2005.846971"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/infcom.2000.832213"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-017-9247-y"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-017-0232-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-010-9337-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/hpsr52026.2021.9481864"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2020.2978386"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ojcoms.2021.3128637"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1609.02907"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/49.1956"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2022.109166"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/jsac.2020.3000371"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485853"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/iwqos52092.2021.9521303"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2024.111340"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2024.3453757"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3389966"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2024.102428"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2022.09.029"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/tnn.2008.2005605"},{"key":"ref33","article-title":"Relational inductive biases, deep learning, and graph networks","author":"Battaglia","year":"2018","journal-title":"arXiv:1806.01261"},{"key":"ref34","article-title":"Neural message passing for quantum chemistry","author":"Gilmer","year":"2017","journal-title":"arXiv:1704.01212"},{"key":"ref35","volume-title":"Algorithms C, Part 5: Graph Algorithms","author":"Sedgewick","year":"2001"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/tc.2024.3365949"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/tcomm.2023.3244239"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/twc.2022.3222781"},{"key":"ref39","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017","journal-title":"arXiv:1710.10903"},{"key":"ref40","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017","journal-title":"arXiv:1707.06347"},{"key":"ref41","article-title":"Multi-agent reinforcement learning: A selective overview of theories and algorithms","author":"Zhang","year":"2019","journal-title":"arXiv:1911.10635"},{"key":"ref42","article-title":"How attentive are graph attention networks?","author":"Brody","year":"2021","journal-title":"arXiv:2105.14491"},{"key":"ref43","article-title":"PyTorch: An imperative style, high-performance deep learning library","author":"Paszke","year":"2019","journal-title":"arXiv:1912.01703"},{"key":"ref44","article-title":"Fast graph representation learning with PyTorch geometric","author":"Fey","year":"2019","journal-title":"arXiv:1903.02428"},{"key":"ref45","article-title":"OpenAI gym","author":"Brockman","year":"2016","journal-title":"arXiv:1606.01540"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.11.001"},{"key":"ref47","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv:1412.6980"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(90)90064-4"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11000124.pdf?arnumber=11000124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T05:06:52Z","timestamp":1747804012000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11000124\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3569236","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}