Bridge-local latency computation is often regarded
with caution, while new shaping mechanisms and timed gates
are developed to achieve deterministic guarantees. However,
these new concepts require additional hardware support in the
forwarding devices, and many of them are based on assumptions
of central control and network-wide information being available.
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 does not rely on
shaping or timed gates and uses the accumulated latency fields
during the reservation process to provide upper bounds with
bridge-local information. The presented delay bound is proven
formally and then evaluated with respect to its accuracy. It shows
that deterministic latency with priority queuing is indeed feasible,
and it indicates the required information that must be provided
during resource reservation, e.g., to protocols developed in IEEE
802.1Qdd.
%0 Conference Paper
%1 info3-inproceedings-2020-17
%A Grigorjew, Alexej
%A Metzger, Florian
%A Hoßfeld, Tobias
%A Specht, Johannes
%A Götz, Franz-Josef
%A Chen, Feng
%A Schmitt, Jürgen
%B 11th International Conference on Network of the Future (NoF)
%D 2020
%K myown ats-performance
%T Bounded Latency with Bridge-Local Stream Reservation and Strict Priority Queuing
%X Bridge-local latency computation is often regarded
with caution, while new shaping mechanisms and timed gates
are developed to achieve deterministic guarantees. However,
these new concepts require additional hardware support in the
forwarding devices, and many of them are based on assumptions
of central control and network-wide information being available.
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 does not rely on
shaping or timed gates and uses the accumulated latency fields
during the reservation process to provide upper bounds with
bridge-local information. The presented delay bound is proven
formally and then evaluated with respect to its accuracy. It shows
that deterministic latency with priority queuing is indeed feasible,
and it indicates the required information that must be provided
during resource reservation, e.g., to protocols developed in IEEE
802.1Qdd.
@inproceedings{info3-inproceedings-2020-17,
abstract = {Bridge-local latency computation is often regarded
with caution, while new shaping mechanisms and timed gates
are developed to achieve deterministic guarantees. However,
these new concepts require additional hardware support in the
forwarding devices, and many of them are based on assumptions
of central control and network-wide information being available.
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 does not rely on
shaping or timed gates and uses the accumulated latency fields
during the reservation process to provide upper bounds with
bridge-local information. The presented delay bound is proven
formally and then evaluated with respect to its accuracy. It shows
that deterministic latency with priority queuing is indeed feasible,
and it indicates the required information that must be provided
during resource reservation, e.g., to protocols developed in IEEE
802.1Qdd.},
added-at = {2021-02-08T13:10:58.000+0100},
author = {Grigorjew, Alexej and Metzger, Florian and Hoßfeld, Tobias and Specht, Johannes and Götz, Franz-Josef and Chen, Feng and Schmitt, Jürgen},
biburl = {https://www.bibsonomy.org/bibtex/21ab307158f06f16b1fa55f90cf1cc95c/uniwue_info3},
booktitle = {11th International Conference on Network of the Future (NoF)},
interhash = {27cf1cc924aa56153fe8777eec2107c7},
intrahash = {1ab307158f06f16b1fa55f90cf1cc95c},
keywords = {myown ats-performance},
month = {11},
timestamp = {2022-03-15T23:13:14.000+0100},
title = {Bounded Latency with Bridge-Local Stream Reservation and Strict Priority Queuing},
year = 2020
}