Routing and Scheduling in Time-Sensitive Networking by Evolutionary Algorithms.

Abstract

Routing and scheduling in Time-Sensitive Networking (TSN) is an NP-hard problem. In this paper, we propose a novel routing and scheduling approach for TSN based on evolutionary algorithm. Specifically, we introduce a flow grouping method that leverages the greatest common divisor to optimize flow aggregation. On this basis, we develop a flow routing strategy that employs a genetic algorithm, where the evaluation function considers not only flow combinability but also path length and network load. By exploiting the non-combinable properties of flows, we effectively reduce the search space for the genetic algorithm. Furthermore, we design a scheduling method based on differential evolution algorithms tailored to TSN's requirements of zero jitter and no frame loss. We propose a gene coding method and rigorously prove its correctness, which significantly reduces the search space of the differential evolution algorithm. The experimental results demonstrate that our approach enables more flows to traverse along the shortest path compared to both k-shortest path methods and integer linear programming approaches, while achieving a faster execution time in large-scale scheduling scenarios.