Constraint programming approaches to joint routing and 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%2F21%3A00350710" target="_blank" >RIV/68407700:21730/21:00350710 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Constraint programming approaches to joint routing and scheduling in time-sensitive networks

Popis výsledku v původním jazyce

The deterministic behavior of real-time communication networks is achieved by time-triggered periodic schedules for critical data traffic. Calculating such a schedule requires satisfying a lot of constraints, which in practice may be difficult due to the increasing number of data flows in the network. In the current approaches, the routes of flows are usually given or determined separately from the scheduling process. If the routes of flows can be computed jointly with scheduling, more flows could be scheduled since the algorithm chooses among alternative paths. This paper formalizes the problem of joint routing and scheduling of time-triggered periodic communication in Time-Sensitive Networks, guaranteeing the required deterministic nature of the communication, and proposes two models in Constraint Programming formalism. We further apply the Logic-Based Benders Decomposition on the proposed models and give an extensive experimental evaluation of our solutions showing that our novel approach that models waiting of frames in queues along with the Logic-Based Benders Decomposition exhibits the best performance and significantly increases the schedulability over the state-of-the-art methods.

Název v anglickém jazyce

Constraint programming approaches to joint routing and scheduling in time-sensitive networks

Popis výsledku anglicky

The deterministic behavior of real-time communication networks is achieved by time-triggered periodic schedules for critical data traffic. Calculating such a schedule requires satisfying a lot of constraints, which in practice may be difficult due to the increasing number of data flows in the network. In the current approaches, the routes of flows are usually given or determined separately from the scheduling process. If the routes of flows can be computed jointly with scheduling, more flows could be scheduled since the algorithm chooses among alternative paths. This paper formalizes the problem of joint routing and scheduling of time-triggered periodic communication in Time-Sensitive Networks, guaranteeing the required deterministic nature of the communication, and proposes two models in Constraint Programming formalism. We further apply the Logic-Based Benders Decomposition on the proposed models and give an extensive experimental evaluation of our solutions showing that our novel approach that models waiting of frames in queues along with the Logic-Based Benders Decomposition exhibits the best performance and significantly increases the schedulability over the state-of-the-art methods.

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

<a href="/cs/project/EF15_003%2F0000466" target="_blank" >EF15_003/0000466: Umělá inteligence a uvažování</a><br>

Návaznosti

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

Rok uplatnění

2021

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

Computers & Industrial Engineering

ISSN

0360-8352

e-ISSN

1879-0550

Svazek periodika

157

Číslo periodika v rámci svazku

September

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

14

Strana od-do

—

Kód UT WoS článku

000659146800057

EID výsledku v databázi Scopus

2-s2.0-85105579224