Enhanced conflict‐aware iterated integer linear programming for IEEE 802.1Qbv Time‐Sensitive Network scheduling

Summary Deterministic communication plays a crucial role for real‐time distributed embedded systems by guaranteeing a low end‐to‐end delay and minimal jitter. Conflict‐aware iterated ILP‐based scheduling (IIS) is an incremental approach to enhance the scalability of single‐shot ILP computation to solve the computationally hard Qbv‐compliant offline scheduling problem for IEEE 802.1 Time‐Sensitive Networking (TSN). Taking into account the conflicting demands of the streams, IIS computes no‐wait schedules by dividing the set of streams into disjoint partitions, each of which is incrementally scheduled by an ILP solver. In this work, defining the no‐wait communication constraints for TSN scheduling, we propose a novel iterated scheduling approach, namely, O‐IIS, with a backtracking mechanism and partial solution support extending the conventional IIS procedure. O‐IIS relies on an ordering strategy to determine the order in which the constructed partitions will be processed by an ILP solver. We evaluate the performance of our approach in terms of schedulability success rate and schedule synthesis time using various network topologies and different partitioning schemes to construct the partitions. The evaluation results show that our approach provides significantly better scheduling performance compared to the existing work in the literature.