Packet-size aware scheduling algorithms in guard band for time sensitive networking

Abstract

As an emerging and promising technology, Time Sensitive Networking (TSN) can be widely used in many real-time systems such as Industrial Internet of Things (IIoT) and Cyber Physical System (CPS). TSN, while ensuring the bounded latency and jitter, exhibits the disadvantage of not being able to efficiently use the bandwidth resources in the guard band. In this paper, we propose an algorithm family named Packet-size Aware Shaping (PAS), which is inspired by abstracting the problem of utilizing the guard band to a classic Precedence-Constrained Knapsack Problem (PCKP). PAS works with the existing TSN standards, having achieved the goal of guaranteeing the end-to-end latency for scheduled time-sensitive applications while fully utilizing the available bandwidth in the guard band for others. Furthermore, we have proposed and implemented several hardware designs for both the current standard TSN scheduler and the programmable one. The simulation results show that the PAS family can achieve satisfying performance in maximizing the resource utilization in the guard band. The synthesis results on Xilinx Vivado show that our proposed Multi-group Push-In-First-Out (MPIFO) scheduler can achieve 100 Mpps scheduling rate for 1024 scheduling items, which is fast enough to support the high-speed TSN.

Hierarchical Cross Traffic Scheduling Based on Time-Aware Shapers for Mobile Time-Sensitive Fronthaul Network

“…Update Slot ( 5) ELSE ( 6) Frame_number←get_Frame_number(S); // Determine the number of frames to be scheduled according to the number of waiting frames in S (7) (8) FOR (i = 1; i++; i < Frame_number) (9) Calculate the Slot set that can transmit the all frame; (10) END FOR (11) FOR (i = 1; i++; i < Frame_number) (12) Slot M ← get_feasible_slot(Slot) //Select the largest data frame to be scheduled, and select the transmissible slot with the most matching length (13) Update Slot (14) According Slot M to get W.start // W.start of each frame can be calculated (15) END FOR // The above is to select the timeslot and get W.start. Next, determine the incoming queue Qm (16) FOR (i = 1; i++; i <Q_number) // The secondary queue contains four queues. Now, determine Q.end.…”

“…The TSN scheduling mechanisms are roughly divided into two categories, namely, synchronous traffic scheduling and asynchronous traffic scheduling [6][7][8][9][10][11][12][13][14][15][16]. At present, synchronous traffic scheduling mainly focuses on gate control lists (GCLs) and TAS-based joint routing.…”

Reconfiguration algorithms for high precision communications in time sensitive networks: Time-aware shaper configuration with IEEE 802.1Qcc

“…Vlk et al [87] have proposed a simple hardware enhancement of a switch along with a relaxed scheduling constraint that increases schedulability and throughput of the time-triggered traf ic but maintains the deterministic nature and timeliness guarantees in a TSN network. Several related scheduling re inements that are orthogonal to the recon iguration studied in this article have been examined in [26,40,43,53,74,93]. We note for completeness that multicast for TSN has been studied in [80,92], while our focus is on unicast traf ic.…”

Research on control and management mechanisms in Time-sensitive networks

“…The time-sensitive network task force is committed to enhancing the real-time transmission capability of the network flow through the formulation of the real-time ethernet protocol standards [1]As a set of standards published by the time-sensitive network, IEEE 802 1Qbv proposes the time-aware flow mechanism and the gate control scheduling mechanism [2]. The combination between the two can separate the time-sensitive flow from the best effort flow, ensuring the certainty of delay and shaking of the time-sensitive data transmission [3].…”