Abstract
Time-Sensitive Network (TSN) is a new network transmission technology, which has the advantages of high data transmission and priority setting. Researching and improving the performance of TSN is of great significance to the development of future industrial communication and automation control fields. However, in practical applications, due to complex scenarios and difficulty in TSN traffic scheduling, traditional network traffic scheduling algorithms are not fully applicable to TSN, which may lead to timeout and inefficiency of traffic scheduling, and it is difficult to guarantee the quality of scheduling. In response to this situation, a routing and scheduling algorithm suitable for TSN is proposed. Firstly, TSN is modeled and analyzed, and the balanced routing algorithm based on bi-directional A* algorithm (BR-BidA*) and the modified greedy randomized adaptive search procedures (MGRASP) are proposed to solve the TSN routing and scheduling respectively. Compared with the contrast algorithm, the simulation results show that the proposed method can improve the performance of the algorithm, and greatly improve the solution quality and scheduling success rate.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call