TSN is an enhancement of Ethernet which provides various mechanisms for
real-time communication. Time-triggered (TT) traffic represents periodic data
streams with strict real-time requirements. Amongst others, TSN supports
scheduled transmission of TT streams, i.e., the transmission of their packets
by edge nodes is coordinated in such a way that none or very little queuing
delay occurs in intermediate nodes. TSN supports multiple priority queues per
egress port. The TAS uses so-called gates to explicitly allow and block these
queues for transmission on a short periodic timescale. The TAS is utilized to
protect scheduled traffic from other traffic to minimize its queuing delay. In
this work, we consider scheduling in TSN which comprises the computation of
periodic transmission instants at edge nodes and the periodic opening and
closing of queue gates.
In this paper, we first give a brief overview of TSN features and standards.
We state the TSN scheduling problem and explain common extensions which also
include optimization problems. We review scheduling and optimization methods
that have been used in this context. Then, the contribution of currently
available research work is surveyed. We extract and compile optimization
objectives, solved problem instances, and evaluation results. Research domains
are identified, and specific contributions are analyzed. Finally, we discuss
potential research directions and open problems.Comment: 34 pages, 19 figures, 9 tables 110 reference