Simulative Assessments of Credit-Based Shaping and Asynchronous Traffic Shaping in Time-Sensitive Networking

Fang, Bingwu; Li, Qiao; Gong, Zijie; Huagang, Xiong

doi:10.1109/icait51223.2020.9315374

Cited by 12 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, we can process and analyze the recorded delay results after simulation experiments. For example, the ATS mechanism is modeled and compared with other shaping mechanisms defined in TSN networks, including the Paternoster algorithm [16], the time-aware shaper (TAS) [23], the frame preemption in TSN [24], and the credit-based shaper [25].…”

Section: Related Workmentioning

confidence: 99%

Formal Modeling of Frame Selection in Asynchronous TSN Communications

Li,

Zhou,

Sun

et al. 2024

Chinese J. Elect.

Self Cite

View full text Add to dashboard Cite

The asynchronous time-sensitive networking (TSN) based on IEEE 802.1Qcr is expected to be a promising solution for the asynchronous transmissions of safety-critical flows without the support of clock synchronization. When the asynchronous traffic shaping (ATS) mechanism is adopted to meet the deadline requirements for transmissions of safety-critical flow, it is necessary to formally verify the real-time properties and corresponding network performance. However, it is still unclear how to build an efficient formal model to evaluate different frame selection methods during the ATS scheduling process, which originate from the dominations of priority or eligibility time. In this paper, we present a formal modeling framework to compare the impacts of different frame selection on transmission sequence under the ATS mechanism. According to the priority level (pATS) or eligibility time (eATS) for flows, two transmission selection methods in ATS are modeled and compared. Then, we verify the real-time properties of ATS. The result shows that the shaping-for-free property can be satisfied with the pATS method but can not be fulfilled with the eATS method. Besides, the timing analysis results illustrate that the eATS method can provide more fairness than the pATS method for the transmission of low-priority flows in TSN networks.

show abstract

Section: Related Workmentioning

confidence: 99%

Formal Modeling of Frame Selection in Asynchronous TSN Communications

Li,

Zhou,

Sun

et al. 2024

Chinese J. Elect.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Bounds on the end-to-end worst-case delay and node backlog size are calculated for each class of deterministic networks for CBS and ATS in the literature [44]. Similarly in the literature [45] CBS and ATS are evaluated. The results in the paper show that ATS provides better real-time guarantees than CBS for non-periodic traffic in a highly loaded network scenario.…”

Section: B Traffic Shaping In Tsnmentioning

confidence: 99%

A Survey of Traffic Shaping Technology in Internet of Things

Sun

et al. 2023

IEEE Access

View full text Add to dashboard Cite

In the era of the Internet of Everything, the burst of traffic will bring many problems. Traffic shaping, as a common means to limit burst traffic rate, achieves ''peak and valley reduction'' to smooth the output rate, avoid network congestion, guarantee the quality of service (QoS) and improve the overall network transmission efficiency. This paper first explains the basic concept of traffic shaping, the related algorithms in traffic shaping, and compares the differences between traffic shaping and traffic policing. It then describes the research on traffic shaping in software-defined networks and the results from the combination of the two. This is followed by an introduction to relatively new technology for industry, timesensitive networks, and an exploration of the functions of various types of traffic shapers in time-sensitive networks. This is followed by a description of case studies of traffic shaping in IoT scenarios and an overview of these traffic shaping schemes, summarizing the usefulness of the shaping schemes. Finally, the future of traffic shaping is explored.

show abstract

“…Specht et al [18,19] and Zhou et al [20,21] proved that the ATS mechanism provides low and bounded worst-case latencies with high link use, low complexity, temporal reshaping, and complete synchronization independence. In [22], the authors concluded that the flow control strategy in the ATS method provides a better real-time performance guarantee for aperiodic traffics than the CBS in a heavy network load. However, after comparing TAS and ATS performances, Nasrallah et al [23] confirmed that the TAS method with tight configurations achieves the related latency targets for both sporadic and periodic data streams.…”

Section: Related Workmentioning

confidence: 99%

Network Calculus-Based Latency for Time-Triggered Traffic under Flexible Window-Overlapping Scheduling (FWOS) in a Time-Sensitive Network (TSN)

et al. 2021

View full text Add to dashboard Cite

Deterministic latency is an urgent demand to pursue the continuous increase in intelligence in several real-time applications, such as connected vehicles and automation industries. A time-sensitive network (TSN) is a new framework introduced to serve these applications. Several functions are defined in the TSN standard to support time-triggered (TT) requirements, such as IEEE 802.1Qbv and IEEE 802.1Qbu for traffic scheduling and preemption mechanisms, respectively. However, implementing strict timing constraints to support scheduled traffic can miss the needs of unscheduled real-time flows. Accordingly, more relaxed scheduling algorithms are required. In this paper, we introduce the flexible window-overlapping scheduling (FWOS) algorithm that optimizes the overlapping among TT windows by three different metrics: the priority of overlapping, the position of overlapping, and the overlapping ratio (OR). An analytical model for the worst-case end-to-end delay (WCD) is derived using the network calculus (NC) approach considering the relative relationships between window offsets for consecutive nodes and evaluated under a realistic vehicle use case. While guaranteeing latency deadline for TT traffic, the FWOS algorithm defines the maximum allowable OR that maximizes the bandwidth available for unscheduled transmission. Even under a non-overlapping scenario, less pessimistic latency bounds have been obtained using FWOS than the latest related works.

show abstract

Simulative Assessments of Credit-Based Shaping and Asynchronous Traffic Shaping in Time-Sensitive Networking

Cited by 12 publications

References 16 publications

Formal Modeling of Frame Selection in Asynchronous TSN Communications

Formal Modeling of Frame Selection in Asynchronous TSN Communications

A Survey of Traffic Shaping Technology in Internet of Things

Network Calculus-Based Latency for Time-Triggered Traffic under Flexible Window-Overlapping Scheduling (FWOS) in a Time-Sensitive Network (TSN)

Contact Info

Product

Resources

About