{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T14:18:54Z","timestamp":1778509134043,"version":"3.51.4"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid through Project TAPIR-CM","doi-asserted-by":"publisher","award":["S2018\/TCS-4496"],"award-info":[{"award-number":["S2018\/TCS-4496"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project IRIS-CM","award":["CM\/JIN\/2019-039"],"award-info":[{"award-number":["CM\/JIN\/2019-039"]}]},{"DOI":"10.13039\/501100011698","name":"Junta de Comunidades de Castilla-La Mancha through Project IRIS-JCCM","doi-asserted-by":"publisher","award":["SBPLY\/19\/180501\/000324"],"award-info":[{"award-number":["SBPLY\/19\/180501\/000324"]}],"id":[{"id":"10.13039\/501100011698","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006302","name":"University of Alcal\u00e1 through Programa de Formaci\u00f3n del Profesorado Universitario","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006302","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3080931","type":"journal-article","created":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T21:24:42Z","timestamp":1621286682000},"page":"74422-74436","source":"Crossref","is-referenced-by-count":18,"title":["The Disjoint Multipath Challenge: Multiple Disjoint Paths Guaranteeing Scalability"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8959-4321","authenticated-orcid":false,"given":"Diego","family":"Lopez-Pajares","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6385-2628","authenticated-orcid":false,"given":"Elisa","family":"Rojas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5545-9463","authenticated-orcid":false,"given":"Juan A.","family":"Carral","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9648-8669","authenticated-orcid":false,"given":"Isaias","family":"Martinez-Yelmo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8522-9933","authenticated-orcid":false,"given":"Joaquin","family":"Alvarez-Horcajo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2001.948886"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2012.09.768"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2011.07.004"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.2990885"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45512-4_13"},{"key":"ref36","author":"wang","year":"2004","journal-title":"Dijkstra Shortest Path Routing Library"},{"key":"ref35","year":"2018","journal-title":"MATLAB (R2018b)"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202792"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2017.080158"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MWENT.2018.8337305"},{"key":"ref12","article-title":"Disjoint path computation systems and methods in optical networks","author":"prakash","year":"2019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2906742"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ATIT49449.2019.9030520"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2019.00343"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12544"},{"key":"ref17","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SCAC.1995.523657"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2018.11.011"},{"key":"ref28","article-title":"Path Generating method, relay device, and computer product","author":"tanaka","year":"2014"},{"key":"ref4","first-page":"1","article-title":"Extending Dijkstra’s shortest path algorithm for software defined networking","author":"jiang","year":"2014","journal-title":"Proc 16th Asia–Pacific Netw Oper Manage Symp"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/115992.115998"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/90.234851"},{"key":"ref6","first-page":"1067","article-title":"Application of Dijkstra algorithm in robot path-planning","author":"wang","year":"2011","journal-title":"Proc 2nd Int Conf Mechanic Autom Control Eng"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2018.8638130"},{"key":"ref5","first-page":"1","article-title":"Dijkstra’s algorithm and Google maps","author":"lanning","year":"2014","journal-title":"Proc ACM Southeast Regional Conf"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140209"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27869-3_45"},{"key":"ref2","first-page":"244","author":"moy","year":"2328","journal-title":"OSPF Version 2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CyberC.2015.45"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1994.337532"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.20532\/cit.2019.1004754"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/18M1223034"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90016-8"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.23919\/CNSM.2017.8255970"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054117500253"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1989.101450"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09432811.pdf?arnumber=9432811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:56:09Z","timestamp":1639770969000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9432811\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3080931","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}