Scheduling Method for Time-Sensitive Network with No-Waiting Flow

With the rapid advancement of communication technology, many time-sensitive applications have emerged, necessitating real-time networks for efficient data transmission. Time-Sensitive Network (TSN) is pivotal in supporting time-critical operations and is widely acknowledged as the optimal solution for meeting real-time network requirements. However, TSN requires effective routing and scheduling strategies to achieve robust real-time performance and bounded low latency. Therefore, this paper proposes a joint routing and scheduling (JRS) method based on a greedy algorithm to address the scheduling challenges associated with time-sensitive traffic in TSN. Specifically, we introduce a bandwidth-balanced routing algorithm to enhance problem-solving success rates while simultaneously reducing node load within the network. Additionally, we present a greedy-based scheduling algorithm that rapidly generates feasible solutions for network scheduling within short time frames. Integrating these routing and scheduling methods expands the solution space for this problem domain. Finally, experimental results demonstrate that our proposed method effectively caters to simple and complex environments encountered in practical use cases with broad applicability. This approach exhibits minimal execution time while maintaining high feasibility in typical topologies; furthermore, it holds the potential to adapt to multiple optimization algorithms.