Timing Analysis of AVB Traffic in TSN Networks Using Network Calculus

Zhao, Luxi; Pop, Paul; Zheng, Zhong; Qiao, Li

doi:10.1109/rtas.2018.00009

Cited by 106 publications

(70 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the first example, we compute delay bounds for two Audio-Video Bridging (AVB) classes in a TSN scheduler [8], [9]. We consider the traffic specification in [10]. Also, the idle slopes of the TSN scheduler for classes A and B are set the same as [10] and are respectively equal to 60% and 15% of the link rate.…”

Section: Improved Delay Boundmentioning

confidence: 99%

“…We consider the traffic specification in [10]. Also, the idle slopes of the TSN scheduler for classes A and B are set the same as [10] and are respectively equal to 60% and 15% of the link rate. In addition, we use the rate-latency service curves of Theorem 1 in [8].…”

Section: Improved Delay Boundmentioning

confidence: 99%

“…An exact definition of service curve can be found in [3,Section 1.3], [4,Section 2.3], and is recalled in Section III, Eq. (10). Roughly speaking, such a rate-latency service curve means that the input traffic is guaranteed to receive a service rate at least equal to R, except for possible service interruptions that may impact the delay by at most T units of time.…”

Section: Introductionmentioning

confidence: 99%

“…(In the above formula, ∆ is finite if the supremum is finite, otherwise ∆ is infinite). This methodology has been successfully applied to many network elements involving a variety of schedulers such as priority schedulers [5,Chapter 7], all schedulers that fall in the class of guaranteed rate scheduling [6], [3, Section 2.1] (including the widespread deficit round robin scheduler [5,Chapter 8]), and more recently Audio-Video Bridging [7] and the Credit Based Shaper [8]- [10]. The bound in Eq.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Improved Delay Bound for a Service Curve Element With Known Transmission Rate

2019

View full text Add to dashboard Cite

Network calculus is often used to prove delay bounds in deterministic networks, using arrival and service curves. We consider a FIFO system that offers a rate-latency service curve and where packet transmission occurs at line rate without pre-emption. The existing network calculus delay bounds take advantage of the service curve guarantee but not of the fact that transmission occurs at full line rate. In this letter, we provide a novel, improved delay bound which takes advantage of these two features. Contrary to existing bounds, ours is per-packet and depends on the packet length. We prove that it is tight.

show abstract

Section: Improved Delay Boundmentioning

confidence: 99%

Section: Improved Delay Boundmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Improved Delay Bound for a Service Curve Element With Known Transmission Rate

2019

View full text Add to dashboard Cite

show abstract

“…ATS, however, still needs to maintain flow states, find the flow to which the packet at the head of the queue belongs, decides whether the packet is to be regulated based on the flow state. Therefore, it does not completely remove the per-flow complexity [20,21]. Figure 3 depicts the architecture of the TSN asynchronous approach.…”

Section: Tsn Asynchronous Approachmentioning

confidence: 99%

Regulating Scheduler (RSC): A Novel Solution for IEEE 802.1 Time Sensitive Network (TSN)

Joung

2019

Electronics

View full text Add to dashboard Cite

Emerging applications such as industrial automation, in-vehicle, professional audio-video, and wide area electrical utility networks require strict bounds on the end-to-end network delay. Solutions so far to such a requirement are either impractical or ineffective. Flow based schedulers suggested in a traditional integrated services (IntServ) framework are O(N) or O(log N), where N is the number of flows in the scheduler, which can grow to tens of thousands in a core router. Due to such complexity, class-based schedulers are adopted in real deployments. The class-based systems, however, cannot provide bounded delays in networks with cycle, since the maximum burst grows infinitely along the cycled path. Attaching a regulator in front of a scheduler to limit the maximum burst is considered as a viable solution. International standards, such as IEEE 802.1 time sensitive network (TSN) and IETF deterministic network (DetNet) are adopting this approach as a standard. The regulator in TSN and DetNet, however, requires flow state information, therefore contradicts to the simple class-based schedulers. This paper suggests non-work conserving fair schedulers, called ‘regulating schedulers’ (RSC), which function as a regulator and a scheduler at the same time. A deficit round-robin (DRR) based RSC, called nw-DRR, is devised and proved to be both a fair scheduler and a regulator. Despite the lower complexity, the input port-based nw-DRR is shown to perform better than the current TSN approach, and to bind the end-to-end delay within a few milliseconds in realistic network scenarios.

show abstract

Reliability Optimization of Traffic Routing in Train Communication Networks Based on Faulty Link Diagnosis

Ren,

He,

Liu

et al. 2024

IEEJ Transactions Elec Engng

View full text Add to dashboard Cite

With the increasing adoption of industrial Ethernet in train communication network (TCN), the limitations of insufficient reliability and incompatibility between different Ethernet technologies have become increasingly apparent. To address these challenges, time‐sensitive networking (TSN) has emerged as a solution, enabling multi‐network convergence and enhancing data transmission determinism and reliability through techniques such as frame replication and elimination for reliability (FRER). However, the utilization of these policies will adversely affect schedulability due to increased network load. To address the issue of link failures in TCN topologies, a routing policy based on faulty link diagnosis is proposed. The proposed policy utilizes an improved max‐min ant system (IMMAS) for diagnosing and resolving faulty links. Furthermore, a routing optimization algorithm is introduced to enhance transmission reliability by planning alternative paths for traffic. To evaluate the performance of the proposed routing algorithm, multiple sets of test cases are conducted separately under different failure scenarios to compare them with other routing policies. The results demonstrate the superior reliability of the proposed routing policy over alternative approaches. Additionally, the traffic utilizing the proposed routing policy show improved schedulability following integer linear programming (ILP) scheduling. © 2024 Institute of Electrical Engineer of Japan and Wiley Periodicals LLC.

show abstract

Timing Analysis of AVB Traffic in TSN Networks Using Network Calculus

Cited by 106 publications

References 13 publications

Improved Delay Bound for a Service Curve Element With Known Transmission Rate

Improved Delay Bound for a Service Curve Element With Known Transmission Rate

Regulating Scheduler (RSC): A Novel Solution for IEEE 802.1 Time Sensitive Network (TSN)

Reliability Optimization of Traffic Routing in Train Communication Networks Based on Faulty Link Diagnosis

Contact Info

Product

Resources

About