Joint Algorithm of Message Fragmentation and No-Wait Scheduling for Time-Sensitive Networks

Time-sensitive networks (TSNs) support not only traditional best-effort communications but also deterministic communications, which send each packet at a deterministic time so that the data transmissions of networked control systems can be precisely scheduled to guarantee hard real-time constraints....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE/CAA journal of automatica sinica Ročník 8; číslo 2; s. 478 - 490
Hlavní autoři: Jin, Xi, Xia, Changqing, Guan, Nan, Zeng, Peng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 01.02.2021
Institutes for Robotics and Intelligent Manufacturing, Chinese Academy of Sciences, Shenyang 110169, China%Department of Computing, Hong Kong Polytechnic University, Hong Kong, China
Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China
Key Laboratory of Networked Control Systems, Chinese Academy of Sciences, Shenyang 110016
Témata:
Algorithms
Data transmission
Delays
Fragmentation
Heuristic algorithms
Heuristic methods
Job shops
Message fragmentation
networked control system
Networked control systems
Optimization
Real time
real-time scheduling
Real-time systems
Scalability
Schedules
Scheduling
time sensitive network
time sensitive network
networked control system
Message fragmentation
real-time scheduling
ISSN:2329-9266, 2329-9274
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í:Time-sensitive networks (TSNs) support not only traditional best-effort communications but also deterministic communications, which send each packet at a deterministic time so that the data transmissions of networked control systems can be precisely scheduled to guarantee hard real-time constraints. No-wait scheduling is suitable for such TSNs and generates the schedules of deterministic communications with the minimal network resources so that all of the remaining resources can be used to improve the throughput of best-effort communications. However, due to inappropriate message fragmentation, the realtime performance of no-wait scheduling algorithms is reduced. Therefore, in this paper, joint algorithms of message fragmentation and no-wait scheduling are proposed. First, a specification for the joint problem based on optimization modulo theories is proposed so that off-the-shelf solvers can be used to find optimal solutions. Second, to improve the scalability of our algorithm, the worst-case delay of messages is analyzed, and then, based on the analysis, a heuristic algorithm is proposed to construct low-delay schedules. Finally, we conduct extensive test cases to evaluate our proposed algorithms. The evaluation results indicate that, compared to existing algorithms, the proposed joint algorithm improves schedulability by up to 50%.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2329-9266
2329-9274
DOI:10.1109/JAS.2021.1003844