Joint Routing and GCL Scheduling Algorithm Based on Tabu Search in TSN

Time sensitive networking (TSN) has been widely adopted and applied in many fields. The scheduling problem of TSN requires that the gate control list (GCL) is calculated according to the flow information in a given topology network. Conventional flow scheduling schemes are usually based on the given routing scheme, which limits the scheduling performance. Besides, current works mostly focus on the time trigger flows (TT). However, AVB flows exist as aperiodic flows in the industrial Internet. The integrated scheduling of these two types of flows is required to improve the overall schedulability. In this paper, a problem model of joint routing and GCL scheduling is proposed. An algorithm based on Tabu search (Tabu-RG) is proposed to solve the problem with specific design of neighborhood movement policy, neighborhood selection policy, as well as diversified function. Experimental results show that compared with the solver method, the proposed algorithm can save 75% of the time cost on the premise of ensuring the solution performance.