The Disjoint Multipath Challenge: Multiple Disjoint Paths Guaranteeing Scalability

Abstract

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.

A secure multi‐path transmission algorithm based on fountain codes

“…According to the derivation of the above formula, we can draw a conclusion: if there is no extra path to choose, the paths can overlap, It is say the more the number of paths finally selected by the route, the higher the data security. This is different from the References 15‐21 that the paths must be disjoint. Therefore, in this transmission model, the security of FMPST algorithm is higher than traditional schemes.…”

“…The scheme in References 13,14 can find multiple paths, when the link fails, the standby paths can be turned on, but they can not reduce the data eavesdropping rate. Most of the multi‐path routing are improved on the basis of Dijkstra algorithm to find multiple disjoint paths such as References 15‐21. Disjoint multipath routing has additional advantages in data reliability and security, but which has obvious shortcomings.…”

An Accuracy-Aware Energy-Efficient Multipath Routing Algorithm for WSNs

“…Extensive research has been devoted to discovering multiple disjointed paths among multiple nodes over the past two or three decades. Although some algorithms only provide two disjointed paths [ 20 , 21 , 22 , 23 ], others can offer more paths [ 24 , 25 ].…”

Comprehensive Exploration and Performance Assessment of SDN Controller

“…SDN also provides the flexibility to customize routing based on various criteria, including optimal routing types (e.g., shortest route, shortest constrained route), price functions, and resource considerations. This adaptability enables the seamless configuration and deployment of routing strategies tailored to specific scenarios, recognizing that a single routing approach may not uniformly suit all types of networks [33].…”