A Feasibility Analysis Framework of Time-Sensitive Networking Using Real-Time Calculus

Abstract

In the field of intelligent connected vehicles, as the rate of in-vehicle communication continues to increase, the importance of real-time and reliability requirements has been more prominent. The time-sensitive networking (TSN) task group is dedicated to the amendments for meeting the urgent needs in the industrial field. In the implementation of the TSN, time latency bounds of critical traffic, memory bounds of nodes and utilization of transmission resources are needed to evaluate the feasibility of the TSNs. In this paper, we propose a framework called component-based analysis (CBA) to analyze these properties. In CBA, we use a data model, a resource model, and a component model to construct an abstract model of the TSNs with the system architecture and analyze the feasibility of this abstract model with real-time calculus. Moreover, we discuss the preemption mechanism mentioned in IEEE 802.1Qbu to handle the conflict of different priority queues, which has a serious influence on the resource model of the TSNs. Finally, we validate this framework by performing an analysis on a synthetic case and compare the obtained properties with different conflict handling mechanisms. INDEX TERMS TSN, component-based analysis, real-time calculus, feasibility.The associate editor coordinating the review of this manuscript and approving it for publication was Yulei Wu. FIGURE 1. On-board network topology example. communication protocols, including the Real-time Transport Protocol [2] (RTP) and Audio Video Bridging [3] (AVB), have been developed, but the complexity of these protocols

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

“…In [5], Zhao et al suggested to allow TT windows to overlap with each other which improved the overall solution space. In [6], Zhang et al used the analytical model in [5] to evaluate the preemption effect on the worst-case TT latency performance. 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.…”

“…In [6], Zhang et al used the analytical model in [5] to evaluate the preemption effect on the worst-case TT latency performance. 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].…”

“…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.…”

“…Also, after achieving a critical latency improvement compared to [7], Shalghum et al [8] optimized the overlap between TT windows based on three aspects; the priority of the overlapped queues, the position of the overlap, and the overlapping ratio. Although the proposed models in [7] and [8] have reduced the worst-case TT latency compared to the models in [5], [6], the window offsets were statically selected without critical optimization with related network metrics and latency behavior. The algorithms in [7] and [8] also did not confirm that the selected window offsets meet the lowest worst-case end-to-end latency bound.…”

A Formal Method for Evaluating the Performance of TSN Traffic Shapers using UPPAAL

“…Luxi Zhao et al [12] proposed a network calculus-based approach to determine the worst-case end-toend delays of audio/video bridging traffic with non-preemption and preemption. Peng Zhang et al [13] presented an analysis framework of TSN to analyse the worst-case latency through real-time calculus. Although the above two approaches can calculate the worst-case delay by arithmetic, they rely too much on parameters and cannot automatically calculate.…”