The disjoint multipath challenge: multiple disjoint paths guaranteeing scalability

The multipath challenge is a research line in continuous development because of its multiple benefits, however, these benefits are overshadowed by scalability, which goes down considerably when the paths are multiple and disjoint. The disjointness aggregates an extra value to the multiple paths, but...

ver descrição completa

Detalhes bibliográficos
Autores: López Pajares, Diego|||0000-0002-8959-4321, Rojas Sánchez, Elisa|||0000-0002-6385-2628, Carral Pelayo, Juan Antonio|||0000-0002-5545-9463, Martinez Yelmo, Isaias|||0000-0001-9648-8669, Álvarez Horcajo, Joaquín|||0000-0002-8522-9933
Formato: artículo
Fecha de publicación:2021
País:España
Recursos:Universidad de Alcalá (UAH)
Repositorio:e_Buah Biblioteca Digital Universidad de Alcalá
Idioma:inglés
OAI Identifier:oai:ebuah.uah.es:10017/48258
Acesso em linha:http://hdl.handle.net/10017/48258
https://dx.doi.org/10.1109/ACCESS.2021.3080931
Access Level:acceso abierto
Palavra-chave:Algorithms
Disjoint
Multipath
Graph theory
Dijkstra's algorithm
Routing
Informática
Computer science
id ES_ccf2e9a5bea2ce4e0a6c6e80932dea75
oai_identifier_str oai:ebuah.uah.es:10017/48258
network_acronym_str ES
network_name_str España
repository_id_str
spelling The disjoint multipath challenge: multiple disjoint paths guaranteeing scalabilityLópez Pajares, Diego|||0000-0002-8959-4321Rojas Sánchez, Elisa|||0000-0002-6385-2628Carral Pelayo, Juan Antonio|||0000-0002-5545-9463Martinez Yelmo, Isaias|||0000-0001-9648-8669Álvarez Horcajo, Joaquín|||0000-0002-8522-9933AlgorithmsDisjointMultipathGraph theoryDijkstra's algorithmRoutingInformáticaComputer scienceThe multipath challenge is a research line in continuous development because of its multiple benefits, however, these benefits are overshadowed by scalability, which goes down considerably when the paths are multiple and disjoint. The disjointness aggregates an extra value to the multiple paths, but it also implies more complex mathematical operations that increase the computational cost. In fact, diverse proposals exist that try to increase scalability by limiting the number of paths obtained to the minimum possible (two-disjoint paths), which is enough for backup applications but not for other purposes. This paper presents an algorithm that solves these drawbacks by discovering multiple disjoint paths among multiple nodes in an efficient way, while keeping bounded the computational cost and ensuring scalability. The proposed algorithm has been validated thoroughly by performing a theoretical analysis, bolstered afterwards by an exhaustive experimental evaluation. The collected results are promising, our algorithm reduces the time spent to obtain the disjoint paths regarding its competitors between one and three orders of magnitude, at the cost of a slight decrease in the number of paths discovered.Comunidad de MadridJunta de Comunidades de Castilla-La ManchaIEEE20212021-05-17journal articlehttp://purl.org/coar/resource_type/c_6501NAhttp://purl.org/coar/version/c_be7fb7dd8ff6fe43info:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10017/48258https://dx.doi.org/10.1109/ACCESS.2021.3080931reponame:e_Buah Biblioteca Digital Universidad de Alcaláinstname:Universidad de Alcalá (UAH)InglésengComunidad de Madrid http://dx.doi.org/10.13039/100012818 Not available S2018%2FTCS-4496 TECNICAS AVANZADAS PARA POTENCIAR LA INTELIGENCIA DE LAS REDES 5GComunidad de Madrid http://dx.doi.org/10.13039/100012818 Not available CM%2FJIN%2F2019-039 INTEGRACION DE REDES IOT EN ENTORNOS INTELIGENTES BASADOS EN SDN%2FNFV Y REDES 5GJunta de Comunidades de Castilla-La Mancha http://dx.doi.org/10.13039/501100011698 Not available SBPLY%2F19%2F180501%2F000324 SERVICIOS Y PROTOCOLOS PARA LA INTEGRACIÓN DE REDES DE BAJA CAPACIDAD EN ENTORNOS INTELIGENTES BASADOS EN SDNopen accesshttp://purl.org/coar/access_right/c_abf2Attribution 4.0 Internationalhttp://creativecommons.org/licenses/by/4.0/info:eu-repo/semantics/openAccessoai:ebuah.uah.es:10017/482582026-06-18T11:13:07Z
dc.title.none.fl_str_mv The disjoint multipath challenge: multiple disjoint paths guaranteeing scalability
title The disjoint multipath challenge: multiple disjoint paths guaranteeing scalability
spellingShingle The disjoint multipath challenge: multiple disjoint paths guaranteeing scalability
López Pajares, Diego|||0000-0002-8959-4321
Algorithms
Disjoint
Multipath
Graph theory
Dijkstra's algorithm
Routing
Informática
Computer science
title_short The disjoint multipath challenge: multiple disjoint paths guaranteeing scalability
title_full The disjoint multipath challenge: multiple disjoint paths guaranteeing scalability
title_fullStr The disjoint multipath challenge: multiple disjoint paths guaranteeing scalability
title_full_unstemmed The disjoint multipath challenge: multiple disjoint paths guaranteeing scalability
title_sort The disjoint multipath challenge: multiple disjoint paths guaranteeing scalability
dc.creator.none.fl_str_mv López Pajares, Diego|||0000-0002-8959-4321
Rojas Sánchez, Elisa|||0000-0002-6385-2628
Carral Pelayo, Juan Antonio|||0000-0002-5545-9463
Martinez Yelmo, Isaias|||0000-0001-9648-8669
Álvarez Horcajo, Joaquín|||0000-0002-8522-9933
author López Pajares, Diego|||0000-0002-8959-4321
author_facet López Pajares, Diego|||0000-0002-8959-4321
Rojas Sánchez, Elisa|||0000-0002-6385-2628
Carral Pelayo, Juan Antonio|||0000-0002-5545-9463
Martinez Yelmo, Isaias|||0000-0001-9648-8669
Álvarez Horcajo, Joaquín|||0000-0002-8522-9933
author_role author
author2 Rojas Sánchez, Elisa|||0000-0002-6385-2628
Carral Pelayo, Juan Antonio|||0000-0002-5545-9463
Martinez Yelmo, Isaias|||0000-0001-9648-8669
Álvarez Horcajo, Joaquín|||0000-0002-8522-9933
author2_role author
author
author
author
dc.subject.none.fl_str_mv Algorithms
Disjoint
Multipath
Graph theory
Dijkstra's algorithm
Routing
Informática
Computer science
topic Algorithms
Disjoint
Multipath
Graph theory
Dijkstra's algorithm
Routing
Informática
Computer science
description The multipath challenge is a research line in continuous development because of its multiple benefits, however, these benefits are overshadowed by scalability, which goes down considerably when the paths are multiple and disjoint. The disjointness aggregates an extra value to the multiple paths, but it also implies more complex mathematical operations that increase the computational cost. In fact, diverse proposals exist that try to increase scalability by limiting the number of paths obtained to the minimum possible (two-disjoint paths), which is enough for backup applications but not for other purposes. This paper presents an algorithm that solves these drawbacks by discovering multiple disjoint paths among multiple nodes in an efficient way, while keeping bounded the computational cost and ensuring scalability. The proposed algorithm has been validated thoroughly by performing a theoretical analysis, bolstered afterwards by an exhaustive experimental evaluation. The collected results are promising, our algorithm reduces the time spent to obtain the disjoint paths regarding its competitors between one and three orders of magnitude, at the cost of a slight decrease in the number of paths discovered.
publishDate 2021
dc.date.none.fl_str_mv 2021
2021-05-17
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
NA
http://purl.org/coar/version/c_be7fb7dd8ff6fe43
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv http://hdl.handle.net/10017/48258
https://dx.doi.org/10.1109/ACCESS.2021.3080931
url http://hdl.handle.net/10017/48258
https://dx.doi.org/10.1109/ACCESS.2021.3080931
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Comunidad de Madrid http://dx.doi.org/10.13039/100012818 Not available S2018%2FTCS-4496 TECNICAS AVANZADAS PARA POTENCIAR LA INTELIGENCIA DE LAS REDES 5G
Comunidad de Madrid http://dx.doi.org/10.13039/100012818 Not available CM%2FJIN%2F2019-039 INTEGRACION DE REDES IOT EN ENTORNOS INTELIGENTES BASADOS EN SDN%2FNFV Y REDES 5G
Junta de Comunidades de Castilla-La Mancha http://dx.doi.org/10.13039/501100011698 Not available SBPLY%2F19%2F180501%2F000324 SERVICIOS Y PROTOCOLOS PARA LA INTEGRACIÓN DE REDES DE BAJA CAPACIDAD EN ENTORNOS INTELIGENTES BASADOS EN SDN
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution 4.0 International
http://creativecommons.org/licenses/by/4.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution 4.0 International
http://creativecommons.org/licenses/by/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv IEEE
publisher.none.fl_str_mv IEEE
dc.source.none.fl_str_mv reponame:e_Buah Biblioteca Digital Universidad de Alcalá
instname:Universidad de Alcalá (UAH)
instname_str Universidad de Alcalá (UAH)
reponame_str e_Buah Biblioteca Digital Universidad de Alcalá
collection e_Buah Biblioteca Digital Universidad de Alcalá
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869419766266986496
score 15,301629

Registos relacionados