Incremental Scheduling of the Time-triggered Traffic on TTEthernet Network

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Incremental Scheduling of the Time-triggered Traffic on TTEthernet Network

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Incremental Scheduling of the Time-triggered Traffic on TTEthernet Network

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

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

Projekt

—

Návaznosti

O - Projekt operacniho programu

Rok uplatnění

2022

Kód důvěrnosti údajů

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

Název statě ve sborníku

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

ISBN

978-989-758-548-7

ISSN

2184-4372

e-ISSN

—

Počet stran výsledku

12

Strana od-do

302-313

Název nakladatele

SciTePress

Místo vydání

Setùbal

Místo konání akce

Melbourne

Datum konání akce

3. 2. 2022

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000818727100035