Cross-Period Joint Scheduling of Task and Network in IEEE 802.1Qbv Time-Sensitive Networks

Time-sensitive networking introduces deterministic latency and low jitter to Ethernet through traffic shaping mechanisms. The IEEE 802.1Qbv standard ensures deterministic transmission of critical flows via the time-aware shaper, where synthesizing the Gate Control List (GCL) schedule is a core challenge. Most SMT-based schedule synthesis algorithms consider only single-period scheduling under a unified timeline, leading to low schedulability. In this paper, we propose a cross-period scheduling algorithm that jointly schedules task and network, ensuring the correctness of cross-period scheduling constraints under a unified timeline through reasonable period mapping. In our defined task tree model, we introduce an optimization objective to minimize the end-to-end latency of task trees. Finally, we evaluate the performance of our algorithm. The results demonstrate that our algorithm significantly improves schedulability and achieves lower end-to-end latency compared to existing algorithms. Moreover, our algorithm can complete the computation within a reasonable time, even in large-scale networks.