A Novel Joint Routing and Scheduling Strategy for TSN-Network Topology Extension

Time-sensitive networking (TSN) is emerging as a significant technology for realizing deterministic network transmissions, holding promising application prospects in industrial Internet, edge computing, and in-vehicle networks, etc. The implementation of a simple yet efficient traffic scheduling mechanism remains a topic of significant interest. In this paper, we propose a novel scheduling method, which extends conventional 2D planar network into 3D unidirectional network and maps time slots into link resources in the 3D network. The traditional joint routing and scheduling optimization problem is thus converted into a pure routing problem in the 3D network. Moreover, constraints such as traffic transmission and link capacity are inherently embedded into the proposed 3D network. Compared to traditional joint routing and scheduling methods, our method obviates the need to establish numerous intricate constraints, thus greatly simplifying the scheduling process. Simulation results show that the proposed method exhibits excellent scheduling performance across various network topology scenarios, with approximately 10% reduction in end-to-end latency, 30% increase in success rate, and 30% decrease in average link load. Additionally, it demonstrates fast execution speed, capable of processing thousands of traffic flows within 30 seconds.