Worst-Case Latency Analysis for IEEE 802.1Qbv Time Sensitive Networks Using Network Calculus

Zhao, Luxi; Pop, Paul; Craciunas, Silviu S.

doi:10.1109/access.2018.2858767

Cited by 100 publications

(75 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this work, we focus on scheduled traffic and leave unscheduled traffic be transmitted using residual bandwidth with best effort. TSN provides time synchronisation and time-division transmission, which enables global scheduling through GCLs [20]. Although the schedule ofTSN can be designed by hand, it soon becomes impractical as the network turns complex and more packets are added to the network.…”

Section: Traffic Scheduling Of Tsn In Control Systemsmentioning

confidence: 99%

“…The defined end-to-end latency imposes zero-jitter, however, with significantly reduced solution space. The scheduling in TSN networks with Quality-of-Service (QoS) requirements can be either performed at the queue level [20] or packet level [14]. With the queue-level scheduling, each FIFO queue in the Qbv switch is assigned with a priority, and packets in a queue with a higher priority are always transmitted first.…”

Section: Scheduling Network Packets In Tsnmentioning

confidence: 99%

“…It is widely considered as the network solution for future automobiles. The IEEE 802.1 TSN standard includes a wide range of subsets, in which one of the most important protocols is the 802.lQbv [5,11,20]. The IEEE 802.lQbv supports timeaware shaper (TAS) using TDMA (time-division multiple access)scheduled queues to access the egress port -controlled by a gate switching logic that is driven by a synchronised global timer and a look-up scheduling table.…”

Section: Introductionmentioning

confidence: 99%

“…In general, short sampling periods enable the potential to achieve good control performance with frequent interactions between the controller and the plant. The state-of-the-art network scheduling techniques for TSN (e.g., [2,13,20]) cannot be directly applied, as they consider neither the hard real-time constraints on network packets nor the control performance of the system.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Fixed-priority scheduling and controller co-design for time-sensitive networks

Dai

Zhao

Jiang

et al. 2020

Proceedings of the 39th International Conference on Computer-Aided Design

View full text Add to dashboard Cite

Section: Traffic Scheduling Of Tsn In Control Systemsmentioning

confidence: 99%

Section: Scheduling Network Packets In Tsnmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fixed-priority scheduling and controller co-design for time-sensitive networks

Dai

Zhao

Jiang

et al. 2020

Proceedings of the 39th International Conference on Computer-Aided Design

View full text Add to dashboard Cite

“…Network Calculus (Le Boudec and Thiran 2001) is a theory for analyzing the bound of latency, queue length, and so on, which is suitable for TSN. Therefore, Zhao et al (2018) use Network Calculus to calculate the worst-case latency that the scheduled traffic may experience along a path with configured time windows.…”

Section: Packet Scheduling Algorithms In Tsnmentioning

confidence: 99%

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

Zhang

Yao

et al. 2020

CCF Trans. Netw.

View full text Add to dashboard Cite

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.

show abstract

SRv6‐based Time‐Sensitive Networks (TSN) with low‐overhead rerouting

et al. 2022

Self Cite

View full text Add to dashboard Cite

Time-Sensitive Networks (TSN) aims at providing a solid underpinning for the support of application connectivity demands across a wide spectrum of use cases and operational environments, such as industrial automation and automotive networks. However, handling network updates in TSN entails additional challenges, stemming from the need to perform both flow rerouting and TSN schedule reconfiguration. To address this issue, we propose a softwaredefined network (SDN)-based approach for low-overhead TSN network updates, exploiting segment routing over IPv6 (SRv6) for path control. To this end, we introduce the concept of TSN subgraphs in order to quickly reschedule the flows traversing the problematic area and propose a TSN-aware routing heuristic to minimize the convergence time. We further describe the control plane implementation and its integration into Mininet, which empowers us to conduct a wide range of performance tests. Our evaluation results indicate that our approach yields faster recovery and reduces significantly the number of required reconfigurations upon failures, at the expense of a small SRv6 encoding/decoding overhead.

show abstract

Worst-Case Latency Analysis for IEEE 802.1Qbv Time Sensitive Networks Using Network Calculus

Cited by 100 publications

References 9 publications

Fixed-priority scheduling and controller co-design for time-sensitive networks

Fixed-priority scheduling and controller co-design for time-sensitive networks

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

SRv6‐based Time‐Sensitive Networks (TSN) with low‐overhead rerouting

Contact Info

Product

Resources

About