Colloquium lecture: 7 March 2023, Piyush Navade (L. Maile)

Symbolic picture for the article. The link opens the image in a large view.
Bild der Präsentationsfläche

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

Time sensitive applications have delay constraints and require highly reliable networks. This project modifies already existing algorithms for finding the least cost shortest paths, putting restrictions on them according to a maxmimum delay threshold. Comparison is done based on the runtime, complexity and the total number of shortest paths the algorithms manage to find in the network. Fault tolerance, and thereby reliability, is ensured by generating multiple link-disjoint paths from source to destination.

 

Time: 10:15 am

Place: room 04.137, Martensstr. 3, Erlangen

or

Zoom:
https://fau.zoom.us/j/63174613617?pwd=SFBCVE4vckZsekkxSEQxSXBqVkZwdz09

Meeting-ID: 631 7461 3617
Kenncode: 044678