Worst-case latency analysis for AVB traffic under overlapping-based time-triggered windows in time-sensitive networks
Deterministic and low end-to-end latency communication is an urgent demand for many safety-critical applications such as autonomous vehicles and automated industries. The time-sensitive network (TSN) is introduced as Ethernet-based amendments in IEEE 802.1 TSN standards to support timetriggered (T...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
Institute of Electrical and Electronics Engineers
2022
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/102648/ |
| _version_ | 1848863849353052160 |
|---|---|
| author | Shalghum, Khaled M. Noordin, Nor K. Sali, Aduwati Hashim, Fazirulhisyam |
| author_facet | Shalghum, Khaled M. Noordin, Nor K. Sali, Aduwati Hashim, Fazirulhisyam |
| author_sort | Shalghum, Khaled M. |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Deterministic and low end-to-end latency communication is an urgent demand for many
safety-critical applications such as autonomous vehicles and automated industries. The time-sensitive
network (TSN) is introduced as Ethernet-based amendments in IEEE 802.1 TSN standards to support timetriggered (TT) traffic in these applications. In the presence of TT flows, TSN is designed to integrate
Audio/Video Bridging (AVB) and Best Effort (BE) traffic types. Although AVB traffic has a lower priority
than TT, it still requires low and deterministic latency performance, which may not be guaranteed under
strict predefined TT scheduling constraints. For this reason, a window-overlapping scheduling algorithm
is recently proposed in different works as analytical forms for TT latency under overlapping-windows
based. But worst-case AVB latency evaluation under overlapped TT windows is also essential for critical
optimizations and tradeoffs. In this paper, a worst-case end-to-end delay (WCD) for AVB traffic under
overlapping-based TT windows (AVB-OBTTW) algorithm is proposed. Separate analytical models are
derived using the network calculus (NC) approach for AVB-OBTTW with both non-preemption and
preemption mechanisms. Using an actual vehicular use case, the proposed models are evaluated with backto-back and porosity configurations under light and heavy loading scenarios. For specific AVB credit
bounds, a clear WCD reduction has been achieved by increasing the overlapping ratio (OR), especially under
back-to-back configuration. Preemption and non-preemption modes are compared under different loading
conditions, resulting in lower WCDs using preemption mode than non-preemption, especially with porosity
style. Compared to the latest related works, AVB-OBTTW reduces WCD bounds and increases unscheduled
bandwidth, leading to the highest enhancements with the maximum allowable OR. |
| first_indexed | 2025-11-15T13:39:27Z |
| format | Article |
| id | upm-102648 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-15T13:39:27Z |
| publishDate | 2022 |
| publisher | Institute of Electrical and Electronics Engineers |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-1026482024-02-07T01:42:17Z http://psasir.upm.edu.my/id/eprint/102648/ Worst-case latency analysis for AVB traffic under overlapping-based time-triggered windows in time-sensitive networks Shalghum, Khaled M. Noordin, Nor K. Sali, Aduwati Hashim, Fazirulhisyam Deterministic and low end-to-end latency communication is an urgent demand for many safety-critical applications such as autonomous vehicles and automated industries. The time-sensitive network (TSN) is introduced as Ethernet-based amendments in IEEE 802.1 TSN standards to support timetriggered (TT) traffic in these applications. In the presence of TT flows, TSN is designed to integrate Audio/Video Bridging (AVB) and Best Effort (BE) traffic types. Although AVB traffic has a lower priority than TT, it still requires low and deterministic latency performance, which may not be guaranteed under strict predefined TT scheduling constraints. For this reason, a window-overlapping scheduling algorithm is recently proposed in different works as analytical forms for TT latency under overlapping-windows based. But worst-case AVB latency evaluation under overlapped TT windows is also essential for critical optimizations and tradeoffs. In this paper, a worst-case end-to-end delay (WCD) for AVB traffic under overlapping-based TT windows (AVB-OBTTW) algorithm is proposed. Separate analytical models are derived using the network calculus (NC) approach for AVB-OBTTW with both non-preemption and preemption mechanisms. Using an actual vehicular use case, the proposed models are evaluated with backto-back and porosity configurations under light and heavy loading scenarios. For specific AVB credit bounds, a clear WCD reduction has been achieved by increasing the overlapping ratio (OR), especially under back-to-back configuration. Preemption and non-preemption modes are compared under different loading conditions, resulting in lower WCDs using preemption mode than non-preemption, especially with porosity style. Compared to the latest related works, AVB-OBTTW reduces WCD bounds and increases unscheduled bandwidth, leading to the highest enhancements with the maximum allowable OR. Institute of Electrical and Electronics Engineers 2022-04 Article PeerReviewed Shalghum, Khaled M. and Noordin, Nor K. and Sali, Aduwati and Hashim, Fazirulhisyam (2022) Worst-case latency analysis for AVB traffic under overlapping-based time-triggered windows in time-sensitive networks. IEEE Access, 10. pp. 43187-43208. ISSN 2169-3536 https://ieeexplore.ieee.org/document/9758791 10.1109/ACCESS.2022.3168136 |
| spellingShingle | Shalghum, Khaled M. Noordin, Nor K. Sali, Aduwati Hashim, Fazirulhisyam Worst-case latency analysis for AVB traffic under overlapping-based time-triggered windows in time-sensitive networks |
| title | Worst-case latency analysis for AVB traffic under overlapping-based time-triggered windows in time-sensitive networks |
| title_full | Worst-case latency analysis for AVB traffic under overlapping-based time-triggered windows in time-sensitive networks |
| title_fullStr | Worst-case latency analysis for AVB traffic under overlapping-based time-triggered windows in time-sensitive networks |
| title_full_unstemmed | Worst-case latency analysis for AVB traffic under overlapping-based time-triggered windows in time-sensitive networks |
| title_short | Worst-case latency analysis for AVB traffic under overlapping-based time-triggered windows in time-sensitive networks |
| title_sort | worst-case latency analysis for avb traffic under overlapping-based time-triggered windows in time-sensitive networks |
| url | http://psasir.upm.edu.my/id/eprint/102648/ http://psasir.upm.edu.my/id/eprint/102648/ http://psasir.upm.edu.my/id/eprint/102648/ |