.png){kind=icon}
返回
Fast IEEE802.1Qbv Gate Scheduling Through Integer Linear Programming
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2024.3440828.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Time-Sensitive Networking (TSN) is an in-development technology that enables predictability over Ethernet or wireless networks. Network interfaces compliant with the IEEE 802.1Qbv standard provide different queues/gates on each bridge egress port. In this way, a global network schedule can be set by defining the opening and closing times (Gate Control List, GCL) for each gate. In this paper, we propose a new method to schedule GCLs by dividing the problem into several subproblems. We use Weighted Fair Queuing (WFQ) to set the ordering of frames, and then generate an Integer Linear Programming (ILP) model to optimize the TSN scenario. Next, we assign gates to the scheduled windows, trying to ensure frame isolation whenever possible. Our results show that we can schedule GCLs around 2 times faster than previous studies and up to 5.5 orders of magnitude faster if we choose to obtain any valid solution instead of the optimal one. In addition, we are able to schedule systems with utilization up to 85%, whereas previous papers reach 65%. Moreover, our approach does not need to predefine the number of windows or gates, as required by other methods.
Keyword:
Streams
Scheduling
Logic gates
Peer-to-peer computing
Bridges
Job shop scheduling
Jitter
Sensitivity analysis
802.1Qbv
delay
GCL
ILP
jitter
real-time
scheduling
TAS
time-sensitive networking
TSN
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Real-Time Scheduling of Massive Data in Time Sensitive Networks With a Limited Number of Schedule Entries有限调度条目的时间敏感网络中海量数据的实时调度.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏分享收藏A Survey of Scheduling Algorithms for the Time-Aware Shaper in Time-Sensitive Networking (TSN)时间敏感网络 (TSN) 中时间感知整形器的调度算法综述IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏分享收藏
查看更多内容