Latency Bounds for TSN Scheduling in the Presence of Clock Synchronization

The IEEE 802.1Qbv (80.21Qbv) standard is designed for traffic requiring deterministic and bounded latencies through strict periodic time synchronization, as specified by IEEE 802.1AS standard. However, internal clock drift in devices causes timing misalignment, introducing further challenges to 802.1Qbv scheduling. Existing solutions, using either complex optimization approaches or non-trivial scheduling heuristics, address this by scheduling frame transmissions only once they are guaranteed to have been fully received, even in the presence of clock drifts. However, this approach introduces additional delays that can impact deadline requirements. This letter analytically derives tight end-to-end latency bounds, allowing us to determine if stream deadlines for a given network will be violated without the need to solve for any scheduling algorithms. It also proposes an approach that results in tighter bounds based on information collected from the synchronization process. The analytical results are compared with simulation results, confirming their validity.

Authors

Institutions

Publication Details

Journal
IEEE Networking Letters
Published
2024-11-27
DOI
https://doi.org/10.1109/lnet.2024.3507792
Citations
1
Primary Topic
Network Time Synchronization Technologies
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Latency Bounds for TSN Scheduling in the Presence of Clock Synchronization

Aviroop Ghosh, Saleh Yousefi, Thomas Kunz
1 citations
IEEE Networking Letters
Network Time Synchronization Technologies
0.35
article

Latency Bounds for TSN Scheduling in the Presence of Clock Synchronization

Aviroop Ghosh, Saleh Yousefi, Thomas Kunz
article en
1 citations

Abstract

The IEEE 802.1Qbv (80.21Qbv) standard is designed for traffic requiring deterministic and bounded latencies through strict periodic time synchronization, as specified by IEEE 802.1AS standard. However, internal clock drift in devices causes timing misalignment, introducing further challenges to 802.1Qbv scheduling. Existing solutions, using either complex optimization approaches or non-trivial scheduling heuristics, address this by scheduling frame transmissions only once they are guaranteed to have been fully received, even in the presence of clock drifts. However, this approach introduces additional delays that can impact deadline requirements. This letter analytically derives tight end-to-end latency bounds, allowing us to determine if stream deadlines for a given network will be violated without the need to solve for any scheduling algorithms. It also proposes an approach that results in tighter bounds based on information collected from the synchronization process. The analytical results are compared with simulation results, confirming their validity.

IEEE Networking LettersVol. 7(1)
Urmia University (IR), Carleton University (CA)
Openalex Percentile: Top 36%
Network Time Synchronization Technologies
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.