Modelling in network calculus a TSN architecture mixing Time-Triggered, Credit Based Shaper and Best-Effort queues
| Autor: | Daigmorte, Hugo, Boyer, Marc, Zhao, Luxi |
|---|---|
| Přispěvatelé: | ONERA - The French Aerospace Lab [Toulouse], ONERA, ONERA - The French Aerospace Lab ( Toulouse ) |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
[ INFO.INFO-MO ] Computer Science [cs]/Modeling and Simulation
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF] [ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI] [INFO.INFO-ES]Computer Science [cs]/Embedded Systems [ INFO.INFO-ES ] Computer Science [cs]/Embedded Systems [ INFO.INFO-PF ] Computer Science [cs]/Performance [cs.PF] [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation |
| Popis: | Time-Sensitive Networking (TSN) is a collection of standards that extend Ethernet to support safety-critical and real-time applications. TSN integrates multiple traffic types, i.e., Time-Triggered (TT) traffic scheduled based on Gate-Control-Lists (G-CLs), Credit-Based Schaper (CBS) traffic that requires bounded latencies, and Best-Effort (BE) traffic , for which no guarantees are provided. This paper considers multiple classes of AVB/CBS traffic in TSN networks, and models its into network calculus theory , in order to compute upper bounds on delays and memory use in such network. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|