SSA:一种面向CQF模型的TSN资源调度算法

时间敏感网络(time sensitive networking，TSN)的目标是在工业控制和5G领域为时间敏感流提供低延迟、低抖动的确定性传输服务.资源调度是保证TSN服务质量的关键技术之一.为此，TSN标准中提出循环队列转发模型(cyclic queuing and forwarding，CQF)，但是缺乏相应的资源调度算法对多流进行合理的资源分配以避免传输冲突.由于时间敏感流量具有周期性、特征预知的特点，主要从时间维度研究如何将CQF模型中的队列资源合理分配给多条数据流.将该问题抽象为多约束条件下的资源规划最大化问题，提出基于起始时隙分配的轻量级资源调度算法(start-slot assignment based scheduling algorithm，SSA).SSA通过对端系统上发送时隙进行调节，在满足约束条件的前提下最大化对队列资源的使用，避免了端到端逐跳的时隙分配.实验结果表明，与不控制时隙的直接调度方式相比，该算法能够将成功调度的流数目平均提高41.84%.

SSA:CQF-oriented Scheduling Algorithm in Time-Sensitive Networking

Time-sensitive networking (TSN) is designed for providing determined transmission service with low latency and jitter in industrial control network and 5G.Resource scheduling， the core of TSN， is very crucial to guarantee the quality of service (QoS). Recently， TSN puts forward cyclic queuing and forwarding model (CQF). However， the corresponding scheduling algorithm is demanded for allocating resource rationally to avoid transmission collision.Since the TSN flow is periodic and predetermined， how to allocate resource for multiple TSN flows rationally from time dimension was researched. Resource allocation into multi-constrained maximization problem was abstracted. Then， a start-slot assignment based scheduling algorithm (SSA) was proposed. By adjusting the send slot at end system， SSA maximizes the queue resource utilization with meeting related constraints， which avoids complex time slot allocation hop by hop. Compared with the case without adjusting sending slot， experimental results demonstrate that SSA improves the number of flows scheduled successfully by 41.84% on average.