TY  - RPRT
A1  - Grigorjew, Alexej
A1  - Metzger, Florian
A1  - Hoßfeld, Tobias
A1  - Specht, Johannes
A1  - Götz, Franz-Josef
A1  - Schmitt, Jürgen
A1  - Chen, Feng
T1  - Technical Report on Bridge-Local Guaranteed Latency with Strict Priority Scheduling
N2  - Bridge-local latency computation is often regarded with caution, as historic efforts with the Credit-Based Shaper (CBS) showed that CBS requires network wide information for tight bounds. Recently, new shaping mechanisms and timed gates were applied to achieve such guarantees nonetheless, but they require support for these new mechanisms in the forwarding devices.

This document presents a per-hop latency bound for individual streams in a class-based network that applies the IEEE 802.1Q strict priority transmission selection algorithm. It is based on self-pacing talkers and uses the accumulated latency fields during the reservation process to provide upper bounds with bridge-local information. The presented delay bound is proven mathematically and then evaluated with respect to its accuracy. It indicates the required information that must be provided for admission control, e.g., implemented by a resource reservation protocol such as IEEE 802.1Qdd. Further, it hints at potential improvements regarding new mechanisms and higher accuracy given more information.
KW  - Echtzeit
KW  - Rechnernetz
KW  - Latenz
KW  - Ethernet
KW  - Latency Bound
KW  - Formal analysis
Y1  - 2020
UR  - https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/19831
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-198310
ER  -