An optimization algorithm for joint routing and scheduling in time-sensitive networks

Time-Sensitive Networking (TSN) is an Ethernet communication standard developed by the IEEE TSN working group. It is an emerging industrial communication technology that can meet the requirements of low latency and high reliability for time-sensitive applications. However, the TSN protocol does not...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2023 8th International Conference on Multimedia Communication Technologies (ICMCT) S. 32 - 37
Hauptverfasser: Lin, ZhenWei, Xu, Bo, Qiu, Kun
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 04.08.2023
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Time-Sensitive Networking (TSN) is an Ethernet communication standard developed by the IEEE TSN working group. It is an emerging industrial communication technology that can meet the requirements of low latency and high reliability for time-sensitive applications. However, the TSN protocol does not specify the specific implementation methods for traffic scheduling, making traffic scheduling algorithm research an ongoing open problem in the TSN field. In this paper, we propose a joint algorithm for routing selection and scheduling. The routing selection considers the requirements of link load and transmission delay, while the scheduling algorithm determines the transmission time of traffic using a hybrid strategy of basic and hyper cycles. Additionally, an improved tabu search algorithm is employed to optimize the results. Furthermore, we implement a TSN simulation environment using the NeSTiNg framework based on OMNeT. The simulation results demonstrate that the proposed algorithm, compared to the reference algorithm, can consistently complete traffic scheduling within a shorter time as network traffic increases. This ensures the real-time transmission performance of streaming traffic. Moreover, the results show that using the sorted set of traffic as the initial solution for the tabu search yields superior results.
DOI:10.1109/ICMCT60483.2023.00013