The disjoint multipath challenge: multiple disjoint paths guaranteeing scalability
AutoresLópez Pajares, Diego; Rojas Sánchez, Elisa; Carral Pelayo, Juan Antonio; Martinez Yelmo, Isaias; Álvarez Horcajo, Joaquín
IdentificadoresEnlace permanente (URI): http://hdl.handle.net/10017/48258
Fecha de publicación2021-05-17
Comunidad de Madrid
Junta de Comunidades de Castilla-La Mancha
López Pajares, D., Rojas, E., Carral, J.A., Martínez Yelmo, I & Álvarez Horcajo, J. 2021, "The disjoint multipath challenge: multiple disjoint paths guaranteeing scalability", IEEE Access, vol. 9, pp. 74422-74436.
info:eu-repo/grantAgreement/CAM//S2018%2FTCS-4496/ES/TECNICAS AVANZADAS PARA POTENCIAR LA INTELIGENCIA DE LAS REDES 5G/TAPIR-CM
info:eu-repo/grantAgreement/CAM//CM%2FJIN%2F2019-039/ES/INTEGRACION DE REDES IOT EN ENTORNOS INTELIGENTES BASADOS EN SDN%2FNFV Y REDES 5G/IRIS-CM
Tipo de documento
Versión del editorhttps://doi.org/10.1109/ACCESS.2021.3080931
Attribution 4.0 International (CC BY 4.0)
Derechos de acceso
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.