Large-scale periodic scheduling in time-sensitive networks

Kód výsledku v IS VaVaI

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

Výsledek na webu

<a href="https://doi.org/10.1016/j.cor.2021.105512" target="_blank" >https://doi.org/10.1016/j.cor.2021.105512</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.cor.2021.105512" target="_blank" >10.1016/j.cor.2021.105512</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Large-scale periodic scheduling in time-sensitive networks

Popis výsledku v původním jazyce

The real-time and safety-critical demands posed in a variety of industrial systems can now be handled on the Ethernet architecture by virtue of the IEEE Time-Sensitive Networking task group. In particular, deterministic nature and timeliness guarantees can be achieved by time-triggered communication schedules that are enabled by the IEEE 802.1Qbv standard. However, generating such a schedule is a computationally challenging task due to several harsh constraints that must be satisfied. This problem is usually transformed into some existing formalism, e.g., Satisfiability Modulo Theories, and solved using a general third-party solver, which has the drawback of limited scalability. Except for some one-pass heuristics, such as the earliest deadline first or as-soon-as-possible scheduling, the current literature does not provide any algorithm tailored to this specific problem of scheduling time-triggered traffic in time-sensitive networks. In this paper, we develop an efficient algorithm that does not use any third-party solver and is based on the search in the space of partial schedules while being guided by the discovered conflicts. Our algorithm calculates schedules for problem instances consisting of 2000 network nodes and more than 10 000 flows.

Název v anglickém jazyce

Large-scale periodic scheduling in time-sensitive networks

Popis výsledku anglicky

The real-time and safety-critical demands posed in a variety of industrial systems can now be handled on the Ethernet architecture by virtue of the IEEE Time-Sensitive Networking task group. In particular, deterministic nature and timeliness guarantees can be achieved by time-triggered communication schedules that are enabled by the IEEE 802.1Qbv standard. However, generating such a schedule is a computationally challenging task due to several harsh constraints that must be satisfied. This problem is usually transformed into some existing formalism, e.g., Satisfiability Modulo Theories, and solved using a general third-party solver, which has the drawback of limited scalability. Except for some one-pass heuristics, such as the earliest deadline first or as-soon-as-possible scheduling, the current literature does not provide any algorithm tailored to this specific problem of scheduling time-triggered traffic in time-sensitive networks. In this paper, we develop an efficient algorithm that does not use any third-party solver and is based on the search in the space of partial schedules while being guided by the discovered conflicts. Our algorithm calculates schedules for problem instances consisting of 2000 network nodes and more than 10 000 flows.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

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

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

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 periodika

Computer & Operations Research

ISSN

0305-0548

e-ISSN

1873-765X

Svazek periodika

137

Číslo periodika v rámci svazku

January

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

16

Strana od-do

—

Kód UT WoS článku

000704296500018

EID výsledku v databázi Scopus

2-s2.0-85114227012