Window-Based Schedule Synthesis for Industrial IEEE 802.1Qbv TSN Networks

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

doi:10.1109/wfcs47810.2020.9114414

Cited by 49 publications

(29 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Satisfiability Modulo Theories (SMT) is a well-developed and widely used approach for this problem [13]- [16]. Latest research [17] proposes window-based heuristic scheduling which relaxes flow isolation but still provides real-time guarantee for flows. However, flow routes must be provided for scheduling whereas recovering link failures requires finding both the alternative routes and schedules.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Run-Time Recovery and Failure Analysis of Time-Triggered Traffic in Time Sensitive Networks

2021

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

“…Due to expensive bandwidth overhead, network designers also tend to minimize the amount of TT flows. The realistic systems evaluated in recent studies [17], [29], [31] indicate that there can be less than twenty TT flows in relatively small TSN use cases.…”

Section: B Model Of Self-recoverable Systemsmentioning

confidence: 99%

Run-Time Recovery and Failure Analysis of Time-Triggered Traffic in Time Sensitive Networks

2021

View full text Add to dashboard Cite

show abstract

“…Other window-based scheduling algorithms were presented in [5]- [8], [34], [35]. In [34], [35], the authors implemented their scheduling algorithms with no synchronization requirement for end systems. However, the prerequisite is that all non-terminal nodes must be synchronized with each other.…”

Section: Related Workmentioning

confidence: 99%

“…Although the presented model in [5] and [6] has enhanced the solution space compared with full-isolated windows, the TT window overlapping was not optimized with the targeted latency deadlines. Moreover, the algorithms were implemented with node-based design without considering the offset difference between the same priority windows in the adjoining nodes [5], [6], [34], [35]. Zhao et al [7] proposed an analytical model based on completely isolated TT windows by considering the offset difference between the same class windows in adjoining nodes.…”

Section: Related Workmentioning

confidence: 99%

Critical Offset Optimizations for Overlapping-Based Time-Triggered Windows in Time-Sensitive Network

et al. 2021

View full text Add to dashboard Cite

Deterministic and low latency communications are increasingly becoming essential requirements for several safety-critical applications, such as automotive and automation industries. The timesensitive networking (TSN) is an element of the new IEEE 802.1 standards that introduced Ethernet-based amendments to support these applications. One of these enhancements was presented in IEEE 802.1Qbv to define time-aware shaping (TAS) technique for time-triggered (TT) traffic scheduling. The TAS mechanism is a window-based scheduling using a gating system controlled by the gate control list (GCL) schedules in all nodes. Although several scheduling algorithms have been proposed to investigate the effects of windowrelated parameters on network performance, the offset difference ( ) between the same-class windows in the adjoining nodes has not been optimized yet. These optimizations are extremely crucial to implement less pessimistic latency schedules. In this paper, we propose an optimized flexible window-overlapping scheduling (OFWOS) algorithm that optimizes TT window offsets based on latency evaluations considering the overlapping between different priority windows at the same node. First, we formulate the GCL timings as mathematical forms under variable s between the same-priority windows. Then, an analytical model is implemented using the network calculus (NC) approach to express the worst-case end-to-end delay ( ) for TT flows and evaluated using a realistic vehicular use case. The OFWOS model optimizes under all overlapping situations between TT windows at the same node. In comparison with latest works of 3-hop and 30-hop TSN connections, the OFWOS reduces the bounds by 8.4% and 32.6%, respectively which accomplishes less pessimistic end-to-end latency bounds.

show abstract

“…However, the computation time needed to generate the schedule varies from some minutes to a few hours, depending on the network complexity (number of nodes/switches, number of flows, etc.). In [26], a novel heuristic scheduler is introduced for the so-called Stream Reservation (SR) classes introduced by the Ethernet Audio Video Bridging (AVB) standards and now rolled into the IEEE 802.1Q-2018 standard. It provides shorter schedule computation times, i.e., in the order of seconds, but it cannot guarantee zero jitter transmissions.…”

Section: Virtualized Tsn Communicationsmentioning

confidence: 99%

SPHERE: A Multi-SoC Architecture for Next-Generation Cyber-Physical Systems Based on Heterogeneous Platforms

et al. 2021

View full text Add to dashboard Cite

This paper presents SPHERE, a project aimed at the realization of an integrated framework to abstract the hardware complexity of interconnected, modern system-on-chips (SoC) and simplify the management of their heterogeneous computational resources. The SPHERE framework leverages hypervisor technology to virtualize computational resources and isolate the behavior of different subsystems running on the same platform, while providing safety, security, and real-time communication mechanisms. The main challenges addressed by SPHERE are discussed in the paper along with a set of new technologies developed in the context of the project. They include isolation mechanisms for mixed-criticality applications, predictable I/O virtualization, the management of time-sensitive networks with heterogeneous traffic flows, and the management of field-programmable gate arrays (FPGA) to provide efficient implementations for cryptography modules, as well as hardware acceleration for deep neural networks. The SPHERE architecture is validated through an autonomous driving use-case.INDEX TERMS cyber-physical systems, embedded systems, real-time systems, hypervisor, FPGA.

show abstract

Window-Based Schedule Synthesis for Industrial IEEE 802.1Qbv TSN Networks

Cited by 49 publications

References 3 publications

Run-Time Recovery and Failure Analysis of Time-Triggered Traffic in Time Sensitive Networks

Run-Time Recovery and Failure Analysis of Time-Triggered Traffic in Time Sensitive Networks

Critical Offset Optimizations for Overlapping-Based Time-Triggered Windows in Time-Sensitive Network

SPHERE: A Multi-SoC Architecture for Next-Generation Cyber-Physical Systems Based on Heterogeneous Platforms

Contact Info

Product

Resources

About