Research On Path Selection And Scheduling Algorithm For Time-Triggered Flow In Time-Sensitive Network

Time-Sensitive Networking is a kind of deterministic Ethernet,which can meet the demand of data deterministic transmission in many industries.However,in the application scenarios of industrial automation,due to the complex network structure and various traffic types,the possibility of collision between different transmission paths of time-triggered flow is different,and transmission delay and jitter of time-triggered flow cannot be guaranteed.Therefore,this paper proposes path selection and scheduling algorithm for time-triggered flow in Time Sensitive Networking to solve the problems of low success rate and long scheduling time.The main research work of this paper is as follows:1.Aiming at the problem of network congestion in the shortest path algorithm of Time-Sensitive Networks,this paper proposes a path selection strategy based on collision detection.The strategy analyzes the impact of the times of collision detection on different paths of time-triggered flow selection in different transmission periods on the running time of the scheduling algorithm,and then mathematically models the time-triggered flow path selection,and quantifies the number of collision detection as link weights,construct a cost function that measures the collision of select different paths of time-triggered flows,find a path that minimizes the number of collisions of time-triggered flows,and reduce the running time of the time-triggered flow scheduling algorithm.2.Based on the proposed path selection strategy based on collision detection,a timetriggered flow objective function is established.Aiming at the low success rate of scheduling time-triggered flow scheduling in the timetable scheduling algorithm,An improved tabu search algorithm is proposed is proposed.By improving the quality of the initial solution,the algorithm improves the combination of the overall time-triggered flow sending sequence to the key link,reduces the search space,and improves the success rate of time-triggered flow scheduling.3.In this paper,a test and verification platform based on self-developed TimeSensitive Networking switches is built,and the path selection strategy(PSS)based on collision detection and based on improved tabu search algorithm(ITS)based on critical links proposed in this paper are tested and verified.The test results from the verification platform show that the time-triggered flow transmission delay and transmission jitter are significantly reduced by using the proposed PSS and ITS algorithm,which verifies the feasibility of the proposed PSS and ITS algorithm.At the same time,this paper also builds a simulation verification platform.The test results show that,in the ITS scheduling algorithm,the running time of the PSS proposed in this paper is 27.7% lower than that of the shortest path algorithm,and 15.1% lower than that of the dynamic path selection algorithm.On the basis of PSS,the proposed ITS improves the scheduling success rate by25% compared with the traditional tabu search algorithm,and has better solution quality and solution efficiency.In summary,the PSS and ITS algorithms in this paper improve the success rate of time-triggered flow scheduling,reduce the running time of the timetriggered flow scheduling algorithm,and ensure the deterministic transmission of timetriggered flows.