Redundancy Combination Scheduling Score Based Fault-Tolerant Scheduling in TSN

With the growing demand for real-time communication in industries, Time-Sensitive Networking (TSN) has become crucial for ensuring low latency. However, transient transmission failures may still affect reliability and are typically mitigated through redundancy. Existing fault-tolerance studies either rely on a single redundancy approach or fail to adequately address the trade-off between redundancy and network schedulability. This paper investigates a fault-tolerant scheduling problem under the Cyclic Queuing Forwarding (CQF) mechanism and proposes a novel scheduling algorithm. The algorithm integrates both spatial and temporal redundancy to meet the reliability requirements of TSN flows while optimizing schedulability. Specifically, it combines redundancy space exploration with scheduling score calculation to prioritize scheduling decisions. Experimental results demonstrate that the proposed algorithm significantly outperforms existing methods.