The Time-Sensitive Networking Scheduling Algorithm Based on Q-learning

Jiayi Zhao, Jing Cheng
{"title":"The Time-Sensitive Networking Scheduling Algorithm Based on Q-learning","authors":"Jiayi Zhao, Jing Cheng","doi":"10.2478/ijanmc-2024-0008","DOIUrl":null,"url":null,"abstract":"\n Time-Sensitive Networking (TSN) occupies a vital position in modern communication domains, with the 802.1Qbv standard being an important network technology designed to meet real-time requirements. This standard requires network traffic to be transmitted within strict time windows, presenting challenges in network planning, necessitating efficient resource allocation and scheduling strategies. This paper addresses the 802.1Qbv planning problem through the introduction of reinforcement learning algorithms, offering an automated and intelligent solution. We have designed a reinforcement learning agent capable of perceiving network status, learning optimal resource allocation strategies, and dynamically adjusting in real-time environments. Through simulation and experimentation, we have validated the effectiveness of our proposed method, comparing it with traditional planning approaches. The contribution of this study lies in introducing a novel solution to the 802.1Qbv planning problem for time-sensitive networks, enhancing network resource utilization and performance. This approach offers strong support for the development and enhancement of TSN-like networks, holding significant importance for meeting the growing demands of real-time applications.","PeriodicalId":193299,"journal":{"name":"International Journal of Advanced Network, Monitoring and Controls","volume":"17 2","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Advanced Network, Monitoring and Controls","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/ijanmc-2024-0008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Time-Sensitive Networking (TSN) occupies a vital position in modern communication domains, with the 802.1Qbv standard being an important network technology designed to meet real-time requirements. This standard requires network traffic to be transmitted within strict time windows, presenting challenges in network planning, necessitating efficient resource allocation and scheduling strategies. This paper addresses the 802.1Qbv planning problem through the introduction of reinforcement learning algorithms, offering an automated and intelligent solution. We have designed a reinforcement learning agent capable of perceiving network status, learning optimal resource allocation strategies, and dynamically adjusting in real-time environments. Through simulation and experimentation, we have validated the effectiveness of our proposed method, comparing it with traditional planning approaches. The contribution of this study lies in introducing a novel solution to the 802.1Qbv planning problem for time-sensitive networks, enhancing network resource utilization and performance. This approach offers strong support for the development and enhancement of TSN-like networks, holding significant importance for meeting the growing demands of real-time applications.
基于 Q-learning 的时间敏感型网络调度算法
时敏网络(TSN)在现代通信领域占据着重要地位,802.1Qbv 标准是为满足实时要求而设计的一项重要网络技术。该标准要求网络流量在严格的时间窗口内传输,这给网络规划带来了挑战,需要高效的资源分配和调度策略。本文通过引入强化学习算法来解决 802.1Qbv 规划问题,提供了一种自动化和智能化的解决方案。我们设计了一个强化学习代理,它能够感知网络状态,学习最优资源分配策略,并在实时环境中进行动态调整。通过模拟和实验,我们验证了所提方法的有效性,并将其与传统规划方法进行了比较。本研究的贡献在于为时间敏感型网络的 802.1Qbv 规划问题引入了一种新的解决方案,提高了网络资源利用率和性能。这种方法为开发和增强类 TSN 网络提供了强有力的支持,对满足日益增长的实时应用需求具有重要意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信