Priority-Sorted Multi-Routing No-Wait Scheduling Algorithm for TSN Based on Train Communication Networks

With the rapid development of rail transit, both the diversity and volume of data transmitted in Train Communication Network (TCN) have significantly increased. Conventional TCN technologies struggle to accommodate this expansion. TimeSensitive Networking (TSN), an enhanced technology built upon traditional Ethernet, not only supports periodic traffic with consistent latency but also maintains compatibility with standard Ethernet services. Its capability to handle high bandwidth, low latency and ensure reliability makes TSN a promising solution for train communications. This paper establishes a network topology and data flow model based on TSN. Building on Time-Aware Shaping (TAS), we propose the Priority-Sorted Multi-Routing No-Wait Scheduling Algorithm (PSMRS). PSMRS distinguishes between priorities and provides better service for high-priority traffic, while also enhancing bandwidth utilization, scheduling success rates, and real-time performance. Furthermore, experimental simulations are conducted using Python and OMNeT++. The results of these experiments demonstrate the feasibility of the proposed algorithm, specifically the findings verify that PSMRS ensures faster response time for high-priority traffic, boosts overall link utilization, increases data flow scheduling success rate, and delivers superior real-time performance in large-scale flow scheduling.