%0 Journal Article 
%A López Pajares, Diego
%A Álvarez Horcajo, Joaquín
%A Rojas Sánchez, Elisa
%A Carral Pelayo, Juan Antonio
%A Martinez Yelmo, Isaias
%T One-Shot Multiple Disjoint Path Discovery Protocol (1S-MDP)
%D 2020
%@ 1089-7798
%U http://hdl.handle.net/10017/48040
%X Multipath routing over disjoint paths is a classic solution to allow better resource allocation, resilience, and security. Current proposals rely on centralised computation or iterative distributed algorithms and exhibit large convergence times. We propose 1S-MDP, a distributed mechanism based on a single network  exploration with concurrent path selection to discover multiple available paths among the target node and the remaining nodes in the network. The paper evaluates 1S-MDP in two different scenarios against previous solutions. We show how it reduces the convergence time by several orders of magnitude with a small decrease in the number of disjoint paths discovered.
%K Multiple disjoint paths
%K Distributed environments
%K Ethernet networks
%K Network exploration
%K Concurrence
%K Informática
%K Computer science
%~ Biblioteca Universidad de Alcala