利用 Daisy-链拓扑解决时间敏感网络的无等待调度
Solving No-wait Scheduling for Time-Sensitive Networks with Daisy-Chain Topology
AI总结：
本文提出了一种基于区间图的高效算法，用于解决时间敏感网络daisy-chain拓扑结构的无等待调度问题，实现了多项式时间复杂度的最优调度计算。
摘要：
时间敏感网络（TSN）是一组旨在通过以太网网络实现确定性和可预测性通信的标准。然而，由于TSN标准未规定如何调度数据流，围绕TSN的主要开放问题是如何高效有效地计算调度方案。在本文中，我们解决了这一开放问题，针对daisy-chain拓扑结构的无等待调度问题，开发了一个高效的算法，能够以多项式时间复杂度计算该拓扑结构的无等待调度方案，该复杂度随流的数量和网络规模呈多项式增长。基本思想是将无等待调度问题转化为一种图着色问题的变种，其中对每个顶点可用的颜色施加了一些限制，并且底层图是一个区间图。我们的主要技术部分是证明该图着色问题变种可以在区间图上以多项式时间解决，尽管对于一般图而言它是NP难的。基于真实TSN系统的评估证明了其最优性和能够扩展到上万条流的能力。
英文摘要：
Time-Sensitive Networking (TSN) is a set of standards aiming to enable deterministic and predictable communication over Ethernet networks. However, as the standards of TSN do not specify how to schedule the data streams, the main open problem around TSN is how to compute schedules efficiently and effectively. In this paper, we solve this open problem for no-wait schedules on the daisy-chain topology, one of the most commonly used topologies. Precisely, we develop an efficient algorithm that optimally computes no-wait schedules for the daisy-chain topology, with a time complexity that scales polynomially in both the number of streams and the network size. The basic idea is to recast the no-wait scheduling problem as a variant of a graph coloring problem where some restrictions are imposed on the colors available for every vertex, and where the underlying graph is an interval graph. Our main technical part is to show that this variant of graph coloring problem can be solved in polynomial time for interval graphs, though it is NP-hard for general graphs. Evaluations based on real-life TSN systems demonstrate its optimality and its ability to scale with up to tens of thousands of streams.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
