Abstract: The development of modern industries,such as smart grid and intelligent driving,imposes stringent demands on network transmission delay and reliability.To tackle these challenges,the IEEE 802.1TSN working group proposes the concept of time-sensitive networks(TSN).Among them,the time-sensitive network model with cyclic queued forwarding(CQF) as the transmission mechanism has garnered significant attention in deterministic network research.However,traffic routing and sche-duling remain critical tasks that need to be addressed.This paper proposes an incremental routing selection scheme based on the greedy algorithm and Dijkstra’s algorithm,leveraging relevant traffic characteristics.This scheme is further integrated with load-balanced time slot offset selection to develop a joint routing and scheduling scheme, addressing the routing-scheduling challenges posed by complex traffic flows in multi-path scenarios.In terms of simulation,a TSN network topology model is established and verified through numerous experiments.The results demonstrate that,compared to traditional greedy and tabu search algorithms,the proposed scheme exhibits notable advantages in terms of time consumption and scheduling success rate.

Key words: TSN, CQF, Routing, Scheduling, Greedy algorithm