Large-scale periodic scheduling in time-sensitive networks

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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 137; s. 105512
Hlavní autoři: Vlk, Marek, Brejchová, Kateřina, Hanzálek, Zdeněk, Tang, Siyu
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.01.2022
Pergamon Press Inc
Témata:
Algorithms
Ethernet
Heuristics
Operations research
Periodic job-shop extensions
Periodic scheduling
Safety critical
Scalable algorithms
Schedules
Scheduling
Solvers
Time-sensitive networking
Time-triggered message scheduling
Time-triggered message scheduling
Time-sensitive networking
Periodic job-shop extensions
Scalable algorithms
Heuristics
Periodic scheduling
ISSN:0305-0548, 1873-765X, 0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 10000 flows. •A novel, efficient, and highly scalable algorithm.•Tailored for IEEE 802.1Qbv TSN networks.•Scrutinized analogy with the job-shop with blocking operations.•Increase in the schedulability by more than 78% over the state-of-the-art methods.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2021.105512