Navade P, Maile L, German R (2023)
Publication Language: English
Publication Type: Conference contribution, Conference Contribution
Publication year: 2023
Conference Proceedings Title: KuVS Fachgespräch - Würzburg Workshop on Modeling, Analysis and Simulation of Next-Generation Communication Networks 2023 (WueWoWAS’23)
DOI: 10.25972/OPUS-32217
Open Access Link: https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-322177
This paper discusses the problem of finding multiple shortest disjoint paths in modern communication networks, which is essential for ultra-reliable and time-sensitive applications. Dijkstra’s algorithm has been a popular solution for the shortest path problem, but repetitive use of it to find multiple paths is not scalable. The Multiple Disjoint Path Algorithm (MDPAlg), published in 2021, proposes the use of a single full graph to construct multiple disjoint paths. This paper proposes modifications to the algorithm to include a delay constraint, which is important in time-sensitive applications. Different delay constraint least-cost routing algorithms are compared in a comprehensive manner to evaluate the benefits of the adapted MDPAlg algorithm. Fault tolerance, and thereby reliability, is ensured by generating multiple link-disjoint paths from source to destination.
APA:
Navade, P., Maile, L., & German, R. (2023). Multiple DCLC Routing Algorithms for Ultra-Reliable and Time-Sensitive Applications. In KuVS Fachgespräch - Würzburg Workshop on Modeling, Analysis and Simulation of Next-Generation Communication Networks 2023 (WueWoWAS’23).
MLA:
Navade, Piyush, Lisa Maile, and Reinhard German. "Multiple DCLC Routing Algorithms for Ultra-Reliable and Time-Sensitive Applications." Proceedings of the KuVS Fachgespräch - Würzburg Workshop on Modeling, Analysis and Simulation of Next-Generation Communication Networks 2023 (WueWoWAS’23) 2023.
BibTeX: Download