4.6 Article

The Disjoint Multipath Challenge: Multiple Disjoint Paths Guaranteeing Scalability

Journal

IEEE ACCESS
Volume 9, Issue -, Pages 74422-74436

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2021.3080931

Keywords

Scalability; Routing; Proposals; Heuristic algorithms; Computational efficiency; Computational complexity; Security; Algorithms; disjoint; multipath; graph theory; Dijkstra's algorithm; routing

Funding

  1. Comunidad de Madrid through Project TAPIR-CM [S2018/TCS-4496]
  2. Project IRIS-CM [CM/JIN/2019-039]
  3. Junta de Comunidades de Castilla-La Mancha through Project IRIS-JCCM [SBPLY/19/180501/000324]
  4. University of Alcala through Programa de Formacion del Profesorado Universitario (FPU)

Ask authors/readers for more resources

The paper presents an algorithm that addresses the scalability issues in multipath communication by efficiently discovering multiple disjoint paths while maintaining bounded computational cost and ensuring scalability. The proposed algorithm has been validated through theoretical analysis and exhaustive experimental evaluation, showing significantly higher efficiency in obtaining disjoint paths compared to competitors.
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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available