Dynamic Slot Injection and Queue Allocation Scheduling Algorithm Implementing Hybrid Flow Scheduling In TSN

Time-sensitive networks provide deterministic, low-latency, and reliably delivered data transmission to existing networks, while being able to retransmit traffic of different priorities on the same network. To achieve this reliable transmission, the Time Sensitive Networking Standard defines a number of flow scheduling methods. In this paper, we innovate the TAS and CQF hybrid scheduling mechanism and propose an algorithm for dynamic slot injection. Compared with the existing hybrid scheduling, the scheduling algorithm in this paper can schedule more mixed time-sensitive traffic. The dynamic time slot injection algorithm dynamically adjusts the injection time slots of different periods of the same stream, and plans the optimal injection time slots for each stream. At the same time, the CQF mechanism has been improved, and a dynamic queue has been added to increase the number of cached streams in the same time slot. We compare the algorithm of this paper with the HSTC algorithm, and the success rate and number of flow scheduling in this paper are much larger than those of the HSTC algorithm.