Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Guo, Miao, Sun, Yifei, Gu, Chaojie, He, Shibo, Shi, Zhiguo
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2407.00987
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866929404631842816
author Guo, Miao
Sun, Yifei
Gu, Chaojie
He, Shibo
Shi, Zhiguo
author_facet Guo, Miao
Sun, Yifei
Gu, Chaojie
He, Shibo
Shi, Zhiguo
contents Time-Sensitive Networking (TSN) serves as a one-size-fits-all solution for mixed-criticality communication, in which flow scheduling is vital to guarantee real-time transmissions. Traditional approaches statically assign priorities to flows based on their associated applications, resulting in significant queuing delays. In this paper, we observe that assigning different priorities to a flow leads to varying delays due to different shaping mechanisms applied to different flow types. Leveraging this insight, we introduce a new scheduling method in mixed-criticality TSN that incorporates a priority adjustment scheme among diverse flow types to mitigate queuing delays and enhance schedulability. Specifically, we propose dependency-aware priority adjustment algorithms tailored to different link-overlapping conditions. Experiments in various settings validate the effectiveness of the proposed method, which enhances the schedulability by 20.57% compared with the SOTA method.
format Preprint
id arxiv_https___arxiv_org_abs_2407_00987
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Exploiting Dependency-Aware Priority Adjustment for Mixed-Criticality TSN Flow Scheduling
Guo, Miao
Sun, Yifei
Gu, Chaojie
He, Shibo
Shi, Zhiguo
Networking and Internet Architecture
Systems and Control
Time-Sensitive Networking (TSN) serves as a one-size-fits-all solution for mixed-criticality communication, in which flow scheduling is vital to guarantee real-time transmissions. Traditional approaches statically assign priorities to flows based on their associated applications, resulting in significant queuing delays. In this paper, we observe that assigning different priorities to a flow leads to varying delays due to different shaping mechanisms applied to different flow types. Leveraging this insight, we introduce a new scheduling method in mixed-criticality TSN that incorporates a priority adjustment scheme among diverse flow types to mitigate queuing delays and enhance schedulability. Specifically, we propose dependency-aware priority adjustment algorithms tailored to different link-overlapping conditions. Experiments in various settings validate the effectiveness of the proposed method, which enhances the schedulability by 20.57% compared with the SOTA method.
title Exploiting Dependency-Aware Priority Adjustment for Mixed-Criticality TSN Flow Scheduling
topic Networking and Internet Architecture
Systems and Control
url https://arxiv.org/abs/2407.00987