Network Calculus Results for TSN: An Introduction

Abstract

Time-Sensitive Networking (TSN) is a set of standards that enables the industry to provide real-time guarantees for time-critical communications with Ethernet hardware. TSN supports various queuing and scheduling mechanisms and allows the integration of multiple traffic types in a single network. Network Calculus (NC) can be used to calculate upper bounds for latencies and buffer sizes within these networks, for example, for safety or real-time traffic. We explain the relevance of NC for TSN-based computer communications and potential areas of application. Different NC analysis approaches have been published to examine different parts of TSN and this paper provides a survey of these publications and presents their main results, dependencies, and differences. We present a consistent presentation of the most important results and suggest an improvement to model the output of sending end-devices. To ease access to the current research status, we introduce a common notation to show how all results depend on each other and also identify common assumptions. Thus, we offer a comprehensive overview of NC for industrial networks and identify possible areas for future work.

References in corpus (4)

• Ultra-Low Latency (ULL) Networks: The IEEE TSN and IETF DetNet Standards and Related 5G ULL Research
• Latency and Backlog Bounds in Time-Sensitive Networking with Credit Based Shapers and Asynchronous Traffic Shaping
• Improved Credit Bounds for the Credit-Based Shaper in Time-Sensitive Networking
• Improved Delay Bound for a Service Curve Element with Known Transmission Rate

Cited by in corpus (11)

• Real-Time Performance of Industrial IoT Communication Technologies: A Review
• Quantitative Performance Comparison of Various Traffic Shapers in Time-Sensitive Networking
• TSN-FlexTest: Flexible TSN Measurement Testbed (Extended Version)
• Worst-case Delay Bounds in Time-Sensitive Networks with Packet Replication and Elimination
• Ensuring Reliable and Predictable Behavior of IEEE 802.1CB Frame Replication and Elimination
• Computationally Efficient Worst-Case Analysis of Flow-Controlled Networks with Network Calculus
• Improved Network Calculus Delay Bounds in Time-Sensitive Networks
• Combining Static and Dynamic Traffic with Delay Guarantees in Time-Sensitive Networking
• Network-Calculus Service Curves of the Interleaved Regulator
• Extending the Network Calculus Algorithmic Toolbox for Ultimately Pseudo-Periodic Functions: Pseudo-Inverse and Composition
• On the Effect of TSN Forwarding Mechanisms on Best-Effort Traffic