EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Routing and Scheduling in Time-Sensitive Networking by Evolutionary Algorithms

Zengkai Wang iD, Weizhi Liao, Xiaoyun Xia iD, Zijia Wang, Yaolong Duan

Biomimetics · 20.05.2025 · 10 (5) · 333

DOI: 10.3390/biomimetics10050333 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Biomimetics, online erschienen am 20.05.2025. Verfasst von Zengkai Wang und 4 weiteren Autor:innen. Beteiligte Einrichtung: School of Artificial Intelligence, Jiaxing University, Jiaxing 314001, China. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 37 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Guangdong Natural Science Foundation, Guangzhou Science and Technology Planning Project.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Schlagwörter

Stichwörter der Autor:innen

Time-Sensitive Networkingdifferential evolution algorithmevolutionary algorithmrouting and scheduling

Autor:innen und Institutionen

  • School of Artificial Intelligence, Jiaxing University, Jiaxing 314001, China.
  • Technology Research and Development Centre, Xuelong Group Co., Ltd., Ningbo 315899, China.
  • School of Computer Science and Cyber Engineering, Guangzhou University, Guangzhou 510006, China.

ORCID-Profile: Zengkai Wang, Xiaoyun Xia

Förderung

  • National Natural Science Foundation of China
  • Guangdong Natural Science Foundation
  • Guangzhou Science and Technology Planning Project

Zitieren

APA

Wang, Z., Liao, W., Xia, X., Wang, Z., & Duan, Y. (2025). Routing and Scheduling in Time-Sensitive Networking by Evolutionary Algorithms. Biomimetics, 10(5), 333. https://doi.org/10.3390/biomimetics10050333

Vancouver

Wang Z, Liao W, Xia X, Wang Z, Duan Y. Routing and Scheduling in Time-Sensitive Networking by Evolutionary Algorithms. Biomimetics. 2025;10(5):333. doi:10.3390/biomimetics10050333

BibTeX
@article{Wang2025,
  author = {Wang, Zengkai and Liao, Weizhi and Xia, Xiaoyun and Wang, Zijia and Duan, Yaolong},
  title = {Routing and Scheduling in Time-Sensitive Networking by Evolutionary Algorithms},
  journal = {Biomimetics},
  year = {2025},
  volume = {10},
  number = {5},
  pages = {333},
  doi = {10.3390/biomimetics10050333}
}
Kostenlos starten →