Network calculus-based latency for time-triggered traffic under Flexible Window-Overlapping Scheduling (FWOS) in a Time-Sensitive Network (TSN)

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...

Full description

Bibliographic Details
Main Authors: Shalghum, Khaled M., Noordin, Nor Kamariah, Sali, Aduwati, Hashim, Fazirulhisyam
Format: Article
Published: MDPI 2021
_version_ 1825937446310772736
author Shalghum, Khaled M.
Noordin, Nor Kamariah
Sali, Aduwati
Hashim, Fazirulhisyam
author_facet Shalghum, Khaled M.
Noordin, Nor Kamariah
Sali, Aduwati
Hashim, Fazirulhisyam
author_sort Shalghum, Khaled M.
collection UPM
description 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.
first_indexed 2024-03-06T10:59:37Z
format Article
id upm.eprints-94346
institution Universiti Putra Malaysia
last_indexed 2024-03-06T10:59:37Z
publishDate 2021
publisher MDPI
record_format dspace
spelling upm.eprints-943462023-04-07T03:43:26Z http://psasir.upm.edu.my/id/eprint/94346/ Network calculus-based latency for time-triggered traffic under Flexible Window-Overlapping Scheduling (FWOS) in a Time-Sensitive Network (TSN) Shalghum, Khaled M. Noordin, Nor Kamariah Sali, Aduwati Hashim, Fazirulhisyam 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. MDPI 2021-04-25 Article PeerReviewed Shalghum, Khaled M. and Noordin, Nor Kamariah and Sali, Aduwati and Hashim, Fazirulhisyam (2021) Network calculus-based latency for time-triggered traffic under Flexible Window-Overlapping Scheduling (FWOS) in a Time-Sensitive Network (TSN). Applied Sciences, 11 (9). art. no. 3896. pp. 1-27. ISSN 2076-3417 https://www.mdpi.com/2076-3417/11/9/3896 10.3390/app11093896
spellingShingle Shalghum, Khaled M.
Noordin, Nor Kamariah
Sali, Aduwati
Hashim, Fazirulhisyam
Network calculus-based latency for time-triggered traffic under Flexible Window-Overlapping Scheduling (FWOS) in a Time-Sensitive Network (TSN)
title Network calculus-based latency for time-triggered traffic under Flexible Window-Overlapping Scheduling (FWOS) in a Time-Sensitive Network (TSN)
title_full Network calculus-based latency for time-triggered traffic under Flexible Window-Overlapping Scheduling (FWOS) in a Time-Sensitive Network (TSN)
title_fullStr Network calculus-based latency for time-triggered traffic under Flexible Window-Overlapping Scheduling (FWOS) in a Time-Sensitive Network (TSN)
title_full_unstemmed Network calculus-based latency for time-triggered traffic under Flexible Window-Overlapping Scheduling (FWOS) in a Time-Sensitive Network (TSN)
title_short Network calculus-based latency for time-triggered traffic under Flexible Window-Overlapping Scheduling (FWOS) in a Time-Sensitive Network (TSN)
title_sort network calculus based latency for time triggered traffic under flexible window overlapping scheduling fwos in a time sensitive network tsn
work_keys_str_mv AT shalghumkhaledm networkcalculusbasedlatencyfortimetriggeredtrafficunderflexiblewindowoverlappingschedulingfwosinatimesensitivenetworktsn
AT noordinnorkamariah networkcalculusbasedlatencyfortimetriggeredtrafficunderflexiblewindowoverlappingschedulingfwosinatimesensitivenetworktsn
AT saliaduwati networkcalculusbasedlatencyfortimetriggeredtrafficunderflexiblewindowoverlappingschedulingfwosinatimesensitivenetworktsn
AT hashimfazirulhisyam networkcalculusbasedlatencyfortimetriggeredtrafficunderflexiblewindowoverlappingschedulingfwosinatimesensitivenetworktsn