DETERMINISTIC6G D3.4 - Report on Optimized Deterministic End-to-End Schedules for Dynamic Systems

Authors

Joachim Sachs (EDD), Jose Costa Requena (CMC), James Gross (KTH), Gourav Prateek Sharma (KTH), Frank Dürr (USTUTT), Simon Egger (USTUTT), Lucas Haug (USTUTT), János Farkas (ETH), Ferenc Fejes (ETH), Balázs Varga (ETH), Marilet De Andrade Jardim (EAB), Oliver Höftberger (B&R)

Abstract

This report describes the concepts and algorithms for optimizing and dynamically adapting end-to-end schedules with wired and wireless network elements (TSN bridges) to enable deterministic end-to-end guarantees in dynamic environments including
mobility, dynamic packet delay, and dynamic stream sets. Different system concepts are proposed to cope with these dynamic effects, such as a YANG data model to describe dynamic stochastic packet delay, different approaches based on the NETCONF protocol to reactively and proactively adapt end-to-end schedules, and a wireless by-pass approach that simplifies endto-end scheduling and its adaptation. Moreover, several algorithms for calculating and adapting robust end-to-end schedules for scheduled traffic according to IEEE 802.1Qbv (timeaware shaper) are proposed. These algorithms feature the maximization of robustness, fast adaptation through highly optimized algorithms, graceful degradation of the quality of service under increasing packet delay, and schedules optimized for the smooth handover of mobile stations.