A Joint Flow Rerouting and Scheduling Algorithm with CQF in Time-Sensitive Networks

• Main Authors: Fei, Hongzhi, Pan, Weiqiang, Wen, Xin, Chen, Zhuoxing, Lu, Yiqin, Qin, Jiancheng
• Format: Conference Proceeding
• Language: English
• Subjects: cyclic queuing and forwarding (CQF); deterministic transmission; Job shop scheduling; joint routing and scheduling; Measurement; Resource management; Routing; Scalability; Scheduling algorithms; Simulation; Time-sensitive networking (TSN)
• ISSN: 2642-6471
• DOI: 10.1109/ICSIP61881.2024.10671550

Time-sensitive networking (TSN) provides low-latency scheduling and reliable transmission in Industry 4.0. Cyclic Queuing and Forwarding (CQF) is recognized as a promising flow shaping mechanism in TSN. However, the existing studies on joint routing and scheduling with CQF have separately solved flow sorting and the injection time slot offset, which may lead to the neglect of some better scheduling schemes. To fully leverage the interconnection between flow sorting and the injection time slot offset, this paper develops an integrated metric, combination matching score (CMS), to assess the scheduling priority of different flow and offset combinations and proposes a joint pending flow rerouting and scheduling (JPFRS) algorithm with the CQF mechanism in TSN. Simulation results demonstrate that the proposed JPFRS algorithm achieves an average improvement of 46.43% in scheduling success rate compared to the baseline, and an average improvement of 11.78% compared to the state-of-the-art mapping score based scheduling (MSS) algorithm.