Master Thesis MSTR-2023-42

BibliographyNieß, Adriaan: Algorithms for calculating robust schedules for time sensitive networking (TSN).
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Master Thesis No. 42 (2023).
49 pages, english.

With the 802.1Qbv standard, the time-sensitive networking (TSN) task group has specified a TDMA-based scheduling method based on Ethernet, that allows to ensure real-time guarantees for time-critical data streams. A major challenge here is the computation of the cyclic schedules required for the switch configurations in the network. There exist already a number of different approaches to calculate these schedules. However, most of them focus on supporting a high number of streams and optimize target functions such as the Makespan. This leads to schedules that are particularly fragile against errors in the system model. To close this gap, we have developed a scheduler based on simple temporal networks (STNs) that maximizes the intervals allocated for the transmission of data packets in order to ensure a very high degree of robustness against unforeseen delay or cross-traffic. In a simulation it could be shown that the calculated schedules could still guarantee a loss-free data transmission under compliance with all deadlines if the actual per-hop network delay deviated from the assumed delay by a factor of up to 7. Furthermore, an even larger error did not immediately lead to a breakdown, but to a gradual degradation. This makes the scheduling method presented here as well as the underlying algorithms particularly interesting for applications that come with a high degree of uncertainty in the system model, such as wireless communications or heterogeneous networks.

Full text and
other links
Department(s)University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems
Superviser(s)Becker, Prof. Christian; Dürr, Dr. Frank
Entry dateNovember 15, 2023
   Publ. Computer Science