Scaling TSN Scheduling for Factory Automation Networks
David Hellmanns, Alexander Glavackij, Jonthan Falk, René Hummen, Stephan Kehrer, Frank Dürr
Abstract
Industry 4.0 and the vision of smart factories drive the need for real-time communication. Time-Sensitive Networking (TSN) augments the IEEE Std 802.1Q with a family of mechanisms enabling real-time communication. One of the key mechanisms is the Time-Aware Shaper (TAS) implementing a TDMA scheme on a traffic class basis. With proper synchronization it can even be used to schedule individual frames or streams. With this capability, the network can guarantee communication deadlines, bounded latency, and bounded jitter. However, for these guarantees a system-wide schedule needs to be calculated, which is an NP-hard problem. Current approaches are mainly based on constraint programming and optimization problems, and, therefore do not scale well for larger topologies and number of streams. In this paper, our contribution is twofold: first, we propose a scheduling model for converged networks supporting different traffic types and, secondly, we introduce a novel procedure for schedule planning of isochronous traffic which exploits the hierarchical structure of factory networks. To this end, we split the network into sub-networks and use a two-stage approach based on a heuristic and tracing. Our evaluation shows that the new scheduling approach outperforms the reference scheduler by more than two orders of magnitude with regard to execution time.