All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Enhancing Schedulability and Throughput of Time-Triggered Traffic in IEEE 802.1Qbv Time-Sensitive Networks

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F20%3A00344021" target="_blank" >RIV/68407700:21730/20:00344021 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/TCOMM.2020.3014105" target="_blank" >https://doi.org/10.1109/TCOMM.2020.3014105</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/TCOMM.2020.3014105" target="_blank" >10.1109/TCOMM.2020.3014105</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Enhancing Schedulability and Throughput of Time-Triggered Traffic in IEEE 802.1Qbv Time-Sensitive Networks

  • Original language description

    Thanks to the standards being developed by IEEE Time-Sensitive Networking (TSN) Task Group, the classical IEEE 802.1 Ethernet architecture is now enhanced to accommodate real-time and safety-critical requirements emerging in various cyber-physical systems. The deterministic nature of the communication is achieved through the time-triggered traffic, which requires introducing strict scheduling constraints that may be an obstacle in finding a feasible schedule. In this article, we propose a simple hardware enhancement of a switch along with a relaxed scheduling constraint that increases schedulability and throughput of the time-triggered traffic but maintains the deterministic nature and timeliness guarantees in a TSN network. We give a formal proof to justify the claims and an algorithm benchmarking and experimental validation to demonstrate the gains. The results show that the number of flows that can be scheduled in the model with the relaxed constraint is on average by 75.1 % larger than in the traditional model.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/TN01000024" target="_blank" >TN01000024: National Competence Center - Cybernetics and Artificial Intelligence</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2020

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    IEEE Transactions on Communications

  • ISSN

    0090-6778

  • e-ISSN

    1558-0857

  • Volume of the periodical

    68

  • Issue of the periodical within the volume

    11

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    16

  • Pages from-to

    7023-7038

  • UT code for WoS article

    000591819400029

  • EID of the result in the Scopus database

    2-s2.0-85096669609