SIA OpenIR  > 工业控制网络与系统研究室
Real-time scheduling of massive data in time sensitive networks with a limited number of schedule entries
Jin X(金曦)1,2,3; Xia CQ(夏长清)1,2,3; Guan N(关楠)4; Xu C(许驰)1,2,3; Li D(李栋)1,2,3; Yin, Yue5; Zeng P(曾鹏)1,2,3
Department工业控制网络与系统研究室
Source PublicationIEEE Access
ISSN2169-3536
2020
Volume8Pages:6751-6767
Indexed ByEI
EI Accession number20200408087013
Contribution Rank1
Funding OrganizationNational Key Research and Development Program of China under Grant 2018YFB1700200, in partby the National Natural Science Foundation of China under Grant 61972389, Grant 61903356, and Grant 61803368, in part by the YouthInnovation Promotion Association of the Chinese Academy of Sciences ; Liaoning Provincial Natural Science Foundation of China under Grant 2019-YQ-09, Grant 20180520029, and Grant 20180540114 ; China Postdoctoral Science Foundation under Grant 2019M661156
KeywordIndustrial Internet of Things massive data real-time scheduling time sensitive networks
Abstract

Time sensitive networks support deterministic schedules over Ethernet networks. Due to their high determinism, high reliability and high bandwidth, they have been considered as a good choice for the backbone network of industrial internet of things. In industrial applications, the backbone network connects multiple industrial field networks together and has to carry massive real-time packets. However, the off-the-shelf time-sensitive network (TSN) switches can deterministically schedule no more than 1024 real-time flows due to the limited number of schedule table entries. The excess real-time flows have to be delivered by best-effort services because the switch only supports the two scheduling services. The best-effort services can reduce average delay, but cannot guarantee the hard real-time constraints of industrial applications. To make the limited number of schedule table entries support more real-time flows, first, we relax scheduling rules to reduce the requirement for schedule table entries and formulate the process of transmitting packets as a satisfiability modulo theories (SMT) specification. Then, we divide the SMT specification into multiple optimization modulo theories (OMT) specifications so that the execution time of solvers can be reduced to an acceptable range. Second, we propose fast heuristic algorithms that combine schedule tables and packet injection control to eliminate scheduling conflicts. Finally, we conduct extensive evaluations. The evaluation results indicate that, compared to existing algorithms, our proposed algorithm requires only one-twentieth the number of schedule entries to schedule the same flow set. 

Language英语
Document Type期刊论文
Identifierhttp://ir.sia.cn/handle/173321/26228
Collection工业控制网络与系统研究室
Corresponding AuthorJin X(金曦)
Affiliation1.State Key Laboratory of Robotics, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China
2.Institutes for Robotics and Intelligent Manufacturing, Chinese Academy of Sciences, Shenyang 110016, China
3.Key Laboratory of Networked Control Systems, Chinese Academy of Sciences, Shenyang 110016, China
4.Department of Computing, Hong Kong Polytechnic University, Hong Kong
5.School of Economics, Liaoning University, Shenyang 110036, China
Recommended Citation
GB/T 7714
Jin X,Xia CQ,Guan N,et al. Real-time scheduling of massive data in time sensitive networks with a limited number of schedule entries[J]. IEEE Access,2020,8:6751-6767.
APA Jin X.,Xia CQ.,Guan N.,Xu C.,Li D.,...&Zeng P.(2020).Real-time scheduling of massive data in time sensitive networks with a limited number of schedule entries.IEEE Access,8,6751-6767.
MLA Jin X,et al."Real-time scheduling of massive data in time sensitive networks with a limited number of schedule entries".IEEE Access 8(2020):6751-6767.
Files in This Item: Download All
File Name/Size DocType Version Access License
Real-time scheduling(2156KB)期刊论文出版稿开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Jin X(金曦)]'s Articles
[Xia CQ(夏长清)]'s Articles
[Guan N(关楠)]'s Articles
Baidu academic
Similar articles in Baidu academic
[Jin X(金曦)]'s Articles
[Xia CQ(夏长清)]'s Articles
[Guan N(关楠)]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Jin X(金曦)]'s Articles
[Xia CQ(夏长清)]'s Articles
[Guan N(关楠)]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: Real-time scheduling of massive data in time sensitive networks with a limited number of schedule entries.pdf
Format: Adobe PDF
This file does not support browsing at this time
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.