Metraipolis › archive › dc_40d1adfed2b0
Decentralized Latency Models and Information Flow for TSN Shapers - A Tutorial — arXiv:2610.11999
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.11999
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:27:31.910Z
- SHA-256 of the archived text
65801147b175846d7c0afa5cfb5f6951b870b474041b953c1c041d041dcab302- Stable URL of this page
https://metraipolis.com/documento/dc_40d1adfed2b0
How to cite
Decentralized Latency Models and Information Flow for TSN Shapers - A Tutorial — arXiv:2610.11999 — arXiv (en), https://arxiv.org/abs/2610.11999 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_40d1adfed2b0 (Metraipolis archive dc_40d1adfed2b0, sha256 65801147b175846d7c0afa5cfb5f6951b870b474041b953c1c041d041dcab302)
BibTeX
@misc{dc40d1adfed2b0,
title = {Decentralized Latency Models and Information Flow for TSN Shapers - A Tutorial — arXiv:2610.11999},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.11999},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_40d1adfed2b0; sha256 65801147b175846d7c0afa5cfb5f6951b870b474041b953c1c041d041dcab302},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11999. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Recent advancements in the fields of industrial automation and in-vehicle communication have also increased the requirements on their underlying networks. Traditional field bus technologies are being replaced by regular Ethernet devices with features from the IEEE Time-Sensitive Networking working group. Their standards are designed to achieve zero congestion loss and deterministic latency bounds, but the specific guarantees can differ depending on the shapers used and how the bounds are calculated. After several contributions to the standardization efforts, this work presents a number of decentralized latency models that can be applied locally on the switches, without requiring global knowledge from the rest of the network. It includes a formal definition of delay segments that allows to incorporate interoperability between different shapers and latency models in the future. It presents pseudo-code suggestions for the latency bounds computation of Strict Priority, Credit-Based Shaping, Asynchronous Traffic Shaping, and Cyclic Queuing and Forwarding, all of which can be applied locally on the devices. Finally, five models were implemented and evaluated with respect to their efficiency in terms of latency, jitter, and number of accepted streams. The results illustrate how different shapers are suited for different networks and traffic distributions. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.NI, nuovi lavori del giorno). Categorie arXiv: Networking and Internet Architecture (cs.NI). Pagina del lavoro: https://arxiv.org/abs/2610.11999 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T05:51:16.415Z dalla pagina https://arxiv.org/list/cs.NI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).