Intra-domain And Inter-Domain Heuristic Traffic Scheduling Algorithm For Time-Sensitive Networks

Time-Sensitive Network(TSN)is a new industrial communication technology,which can ensure low delay,high reliability and other requirements of time sensitive services.At the same time,TSN also has the advantages of high data transmission and supporting priority settings.Compared with standard Ethernet,TSN can share network with high priority data flow to ensure data transmission with minimum time jitter in accurate time.Studying and improving the performance of TSN is of great significance to the development of industrial communication and automation control in the future.In the related research work of TSN,traffic scheduling algorithm is a very important part.Whether the service data can be transmitted timely and reliably is closely related to the performance of the scheduling algorithm.However,in practical applications,due to the complexity of network structures,network traffic transmission requirements vary greatly,making the scheduling of TSN very difficult.The traditional network traffic scheduling algorithms are not completely suitable for TSN,which may lead to a series of problems,such as high network delay,low scheduling success rate,large time consumption and so on.It is difficult to ensure the quality of service scheduling.Therefore,this paper studies the intra-domain and inter-domain traffic scheduling problems in TSN,and designs time sensitive traffic scheduling algorithms for different service scenarios.In this paper,we first propose a routing and scheduling algorithm for intra-domain TSN.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 above algorithm can reduce the traffic time delay caused by link congestion,and the quality of the algorithm is improved.For the problem of inter-domain traffic scheduling in TSN,there is few researches in the literature.A coordination of TSN and optical transport network is presented in this paper.A Greedy Tabu Search Algorithm(GTSA)for inter-domain traffic scheduling is proposed,which is combined with the resource scheduling in optical networks,and the final scheduling success rate is taken as the objective function.Through the experimental simulation,it is proved that the above method improves the schedulability of the algorithm at the cost of sacrificing part of the running time,and the performance of the algorithm is more outstanding in the scenario with a large number of time triggered flows,which can meet the service scheduling requirements in the target scenario.