Saved in:
Bibliographic Details
Main Authors: Debnath, Rubi, Zhao, Luxi, Steinhorst, Sebastian
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2503.07893
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917953252884480
author Debnath, Rubi
Zhao, Luxi
Steinhorst, Sebastian
author_facet Debnath, Rubi
Zhao, Luxi
Steinhorst, Sebastian
contents Time-Sensitive Networking (TSN) supports multiple traffic types with diverse timing requirements, such as hard real-time (HRT), soft real-time (SRT), and Best Effort (BE) within a single network. To provide varying Quality of Service (QoS) for these traffic types, TSN incorporates different scheduling and shaping mechanisms. However, assigning traffic types to the proper scheduler or shaper, known as Traffic-Type Assignment (TTA), is a known NP-hard problem. Relying solely on domain expertise to make these design decisions can be inefficient, especially in complex network scenarios. In this paper, we present a proof-of-concept highlighting the advantages of a learning-based approach to the TTA problem. We formulate an optimization model for TTA in TSN and develop a Proximal Policy Optimization (PPO) based Deep Reinforcement Learning (DRL) model, called ``TTASelector'', to assign traffic types to TSN flows efficiently. Using synthetic and realistic test cases, our evaluation shows that TTASelector assigns a higher number of traffic types to HRT and SRT flows compared to the state-of-the-art Tabu Search-based metaheuristic method.
format Preprint
id arxiv_https___arxiv_org_abs_2503_07893
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Learning-Based Traffic Classification for Mixed-Critical Flows in Time-Sensitive Networking
Debnath, Rubi
Zhao, Luxi
Steinhorst, Sebastian
Networking and Internet Architecture
Time-Sensitive Networking (TSN) supports multiple traffic types with diverse timing requirements, such as hard real-time (HRT), soft real-time (SRT), and Best Effort (BE) within a single network. To provide varying Quality of Service (QoS) for these traffic types, TSN incorporates different scheduling and shaping mechanisms. However, assigning traffic types to the proper scheduler or shaper, known as Traffic-Type Assignment (TTA), is a known NP-hard problem. Relying solely on domain expertise to make these design decisions can be inefficient, especially in complex network scenarios. In this paper, we present a proof-of-concept highlighting the advantages of a learning-based approach to the TTA problem. We formulate an optimization model for TTA in TSN and develop a Proximal Policy Optimization (PPO) based Deep Reinforcement Learning (DRL) model, called ``TTASelector'', to assign traffic types to TSN flows efficiently. Using synthetic and realistic test cases, our evaluation shows that TTASelector assigns a higher number of traffic types to HRT and SRT flows compared to the state-of-the-art Tabu Search-based metaheuristic method.
title Learning-Based Traffic Classification for Mixed-Critical Flows in Time-Sensitive Networking
topic Networking and Internet Architecture
url https://arxiv.org/abs/2503.07893