{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T17:06:58Z","timestamp":1777741618931,"version":"3.51.4"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100024250","name":"Israel Innovation Authority","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100024250","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Select. Areas Commun."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1109\/jsac.2025.3528813","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T19:58:13Z","timestamp":1736798293000},"page":"437-447","source":"Crossref","is-referenced-by-count":8,"title":["RRO: A Regularized Routing Optimization Algorithm for Enhanced Throughput and Low Latency With Efficient Complexity"],"prefix":"10.1109","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-5243-7986","authenticated-orcid":false,"given":"David","family":"Zenati","sequence":"first","affiliation":[{"name":"School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Be’er Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4664-1682","authenticated-orcid":false,"given":"Tzalik","family":"Maimon","sequence":"additional","affiliation":[{"name":"Ceragon Networks Ltd., Tel Aviv-Yafo, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0532-009X","authenticated-orcid":false,"given":"Kobi","family":"Cohen","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Be’er Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.1900742"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/9781119562306","article-title":"Machine learning for spectrum access and sharing","volume-title":"Machine Learning for Future Wireless Communications","author":"Luo","year":"2020"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s41403-022-00372-w"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/iconat57137.2023.10079976"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2970829"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/0952813X.2020.1818291"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3171666"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICETET-SIP58143.2023.10151496"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2989580"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3118410"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2021.3125282"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2024.3356257"},{"key":"ref13","first-page":"451","article-title":"Ad hoc networks routing: Shortest path is enough","volume-title":"Proc. Int. Conf. Wireless Netw. (ICWN)","author":"Heal"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139565844"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2623317"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638236"},{"key":"ref18","first-page":"232","article-title":"Adaptive shortest-path routing under unknown and stochastically varying link states","volume-title":"Proc. 10th Int. Symp. Modeling Optim. Mobile, Ad Hoc Wireless Netw. (WiOpt)","author":"Liu"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3282365"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2016.7422412"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-005-1450-0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879361"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062262"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462224"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2195503"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2783846"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2011.083111.110194"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2094204"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2018.2809722"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2904329"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2879433"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3230872"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/twc.2024.3491035"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3014926"},{"key":"ref36","article-title":"Deep reinforcement learning for scheduling and power allocation in a 5G urban mesh","author":"Gahtan","year":"2022","journal-title":"arXiv:2210.01423"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/NoF58724.2023.10302794"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton49937.2022.9929423"},{"key":"ref39","article-title":"Deep multi-agent reinforcement learning for decentralized active hypothesis testing","author":"Szostak","year":"2023","journal-title":"arXiv:2309.08477"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2019.8851733"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN52387.2021.9533549"},{"key":"ref42","article-title":"Deep reinforcement learning meets graph neural networks: An optical network routing use case","author":"Almasan","year":"2019","journal-title":"arXiv:1910.07421"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2023.3310353"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3277431"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2023.103347"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2431121"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715934"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.3390\/jsan13010009"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.5220\/0011791200003399"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1364\/JON.3.000363"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.5121\/ijcnc.2012.4202"}],"container-title":["IEEE Journal on Selected Areas in Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/49\/10893724\/10838706.pdf?arnumber=10838706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T20:26:16Z","timestamp":1740083176000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10838706\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":51,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/jsac.2025.3528813","relation":{},"ISSN":["0733-8716","1558-0008"],"issn-type":[{"value":"0733-8716","type":"print"},{"value":"1558-0008","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2]]}}}