A Routing Algorithm for Ensuring the Schedulability of Time-Sensitive Flows

While current Time-Sensitive Network (TSN) research focuses on reducing end-to-end delay through scheduling optimization, it often overlooks routing impacts. Traditional methods like Shortest Path First (SPF) struggle with new flow schedulability and existing flow disruption. This paper presents a TSN routing algorithm based on network calculus, calculating worst-case delays to ensure deadline compliance and balance link loads. A new flow prioritization method further optimizes scheduling. Experiments show the proposed algorithm improves scheduling success, keeps average delay under 70 μs, reduces maximum link load by 18.5% compared to wt-ECMP, and achieves a tenfold runtime reduction.