Technical Report on Bridge-Local Guaranteed Latency with Strict Priority Scheduling
Zitieren Sie bitte immer diese URN: urn:nbn:de:bvb:20-opus-198310
- 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 isBridge-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.…
Autor(en): | Alexej Grigorjew, Florian Metzger, Tobias Hoßfeld, Johannes Specht, Franz-Josef Götz, Jürgen Schmitt, Feng Chen |
---|---|
URN: | urn:nbn:de:bvb:20-opus-198310 |
Dokumentart: | Report (Bericht) |
Institute der Universität: | Fakultät für Mathematik und Informatik / Institut für Informatik |
Sprache der Veröffentlichung: | Englisch |
Erscheinungsjahr: | 2020 |
Sonstige beteiligte Institutionen: | Siemens AG |
Allgemeine fachliche Zuordnung (DDC-Klassifikation): | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 000 Informatik, Informationswissenschaft, allgemeine Werke |
Normierte Schlagworte (GND): | Echtzeit; Rechnernetz; Latenz; Ethernet |
Freie Schlagwort(e): | Formal analysis; Latency Bound |
Fachklassifikation Informatik (CCS): | G. Mathematics of Computing / G.0 GENERAL |
Datum der Freischaltung: | 22.01.2020 |
Lizenz (Deutsch): | CC BY-SA: Creative-Commons-Lizenz: Namensnennung, Weitergabe unter gleichen Bedingungen 4.0 International |