CQF-Based Joint Routing And Scheduling Algorithm In Time-Sensitive Networks

Time-sensitive networks provide deterministic transport for time-sensitive flows in industrial control. IEEE802.1Qch proposes a circular queuing and forwarding mechanism based on ping-pong queues. Many of the scheduling algorithms proposed for time-sensitive networks do not take into account the network topology. For the IEEE 802.1Qch standard in time-sensitive networks, a joint routing and scheduling model that allocates resources based on starting time slots is proposed, taking into account the traffic, network model and traffic characteristics. And by reasonably allocating the network resources for each scheduling time slot, the network load is more balanced. Simulation results show that the number of successfully scheduled flows can be increased by 17% compared with other algorithms. On this basis, the effect of the sorting method and the length of the queue on the results with is explored.