One-Shot Multiple Disjoint Path Discovery Protocol (1S-MDP)
Author
López Pajares, DiegoIdentifiers
Enlace permanente (URI): http://hdl.handle.net/10017/48040DOI: 10.1109/LCOMM.2020.2990885
ISSN: 1089-7798
Publisher
IEEE
Date
2020-08-01Patrocinadores
Comunidad de Madrid
Cita bibliográfica
López Pajares, D., Álvarez Horcajo, J., Rojas, E., Carral, J.A. & Martínez Yelmo, I. 2020, "One-Shot Multiple Disjoint Path Discovery Protocol (1S-MDP)", IEEE Communications Letters, vol. 24, no. 8, pp. 1660-1663.
Palabras clave
Multiple disjoint paths
Distributed environments
Ethernet networks
Network exploration
Concurrence
Proyecto
TAPIR-CM / S2018/TCS-4496 (Comunidad de Madrid)
IRIS-CM / CM/JIN/2019-039 (Comunidad de Madrid)
Tipo de documento
info:eu-repo/semantics/article
Versión
info:eu-repo/semantics/acceptedVersion
Versión del editor
https://doi.org/10.1109/LCOMM.2020.2990885Derechos
Attribution 4.0 International (CC BY 4.0)
© 2020 IEEE
Derechos de acceso
info:eu-repo/semantics/openAccess
Abstract
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.
Files in this item
Files | Size | Format |
|
---|---|---|---|
One_Shot_Lopez_IEEE_Commun_Let ... | 948.8Kb |
![]() |
Files | Size | Format |
|
---|---|---|---|
One_Shot_Lopez_IEEE_Commun_Let ... | 948.8Kb |
![]() |