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”

Incremental Scheduling of the Time-triggered Traffic on TTEthernet Network

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F22%3A00364117" target="_blank" >RIV/68407700:21730/22:00364117 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.5220/0010953700003117" target="_blank" >https://doi.org/10.5220/0010953700003117</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.5220/0010953700003117" target="_blank" >10.5220/0010953700003117</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Incremental Scheduling of the Time-triggered Traffic on TTEthernet Network

  • Original language description

    Complex systems are often developed incrementally when subsequent models must be backward compatible with the original ones. The need to exchange high-volume data, for example, multimedia streams in the avionic systems, together with safety-critical data, puts demands on both the high bandwidth and the deterministic behavior of the communication. TTEthernet is an Ethernet based protocol that enables the transmission of the time-triggered messages. Thus, synthesizing a good schedule that meets all the deadline requirements and preserves the backward compatibility with the schedules of preceding models is essential for the performance of the whole system. In this paper, we study the problem of designing periodic communication schedules for time-triggered traffic. The aim is to maximize the uninterrupted gap for the remaining non-deadline-constrained traffic. The provided scheduling algorithm, based on MILP and CP formulation, can obtain good schedules in a reasonable time while p reserving the backward compatibility. The experimental results show that the time demands of the algorithm grows exponentially with the number of messages to be transmitted, but, even for industrial-sized instances with more than 2000 messages, the algorithm is able to return the close optimal schedules in the order of hundreds of seconds.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • 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

  • Continuities

    O - Projekt operacniho programu

Others

  • Publication year

    2022

  • 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

  • Article name in the collection

    Proceedings of the 11th International Conference on Operations Research and Enterprise Systems

  • ISBN

    978-989-758-548-7

  • ISSN

    2184-4372

  • e-ISSN

  • Number of pages

    12

  • Pages from-to

    302-313

  • Publisher name

    SciTePress

  • Place of publication

    Setùbal

  • Event location

    Melbourne

  • Event date

    Feb 3, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000818727100035