Multiple DCLC Routing Algorithms for Ultra-Reliable and Time-Sensitive Applications

Please always quote using this URN: 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 delayThis 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.show moreshow less

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics
Metadaten
Author: Piyush Navade, Lisa Maile, Reinhard German
URN:urn:nbn:de:bvb:20-opus-322177
Document Type:Working Paper
Faculties:Fakultät für Mathematik und Informatik / Institut für Informatik
Language:English
Parent Title (English):KuVS Fachgespräch - Würzburg Workshop on Modeling, Analysis and Simulation of Next-Generation Communication Networks 2023 (WueWoWAS’23)
Year of Completion:2023
Pagenumber:4
DOI:https://doi.org/10.25972/OPUS-32217
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Tag:Dijkstra’s algorithm; delay constrained; disjoint multi-paths; least cost; shortest path routing
Release Date:2023/07/26
Collections:Sammel- und Konferenzbände (Edited volumes and conference proceedings) / Würzburg Workshop on Modeling, Analysis and Simulation of Next-Generation Communication Networks (WueWoWas'23) / Arbeitspapiere (Working Paper)
Licence (German):License LogoCC BY-SA: Creative-Commons-Lizenz: Namensnennung, Weitergabe unter gleichen Bedingungen 4.0 International