Large-scale periodic scheduling in time-sensitive networks

Result code in 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>
Result on the web
<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>

Result language
angličtina
Original language name
Large-scale periodic scheduling in time-sensitive networks
Original language description
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.
Czech name
—
Czech description
—

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)

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)