Adaptive Group Routing and Scheduling in Multicast Time-Sensitive Networks
Traditionally, industrial networks rely on field bus to support real-time applications. In the trend of industrial internet of things (IIoT), traffic load has increased dramatically, and industrial networks are moving towards time-sensitive networking (TSN), which is based on the widely used Etherne...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9000927/ |
| _version_ | 1819173496208490496 |
|---|---|
| author | Qinghan Yu Ming Gu |
| author_facet | Qinghan Yu Ming Gu |
| author_sort | Qinghan Yu |
| collection | DOAJ |
| description | Traditionally, industrial networks rely on field bus to support real-time applications. In the trend of industrial internet of things (IIoT), traffic load has increased dramatically, and industrial networks are moving towards time-sensitive networking (TSN), which is based on the widely used Ethernet. In TSN, the time-triggered mechanism is a promising technology for real-time control due to its ability to provide deterministic latency and jitter guarantees. However, this mechanism is mainly based on offline computed schedules, making it difficult to satisfy dynamic requirements in data transmission of IIoT. In this paper, we propose an adaptive group routing and scheduling (AGRS) approach in multicast time-sensitive networks. The framework of this approach contains three phases including pre-processing, schedule synthesis, and post-processing phases. While the pre-processing phase first prunes unnecessary links and adaptively groups qualified complete subgraphs of the network to obtain a simplified topology, the schedule synthesis phase then jointly considers routing and scheduling processes based on the simplified topology to improve schedulability. Finally, the post-processing phase handles the scheduling results of previous phases to generate a feasible schedule. Experiments show that our approach improves schedulability by 68% and reduces execution time by 74% for multicast time-sensitive networks compared with existing approaches. |
| first_indexed | 2024-12-22T20:24:00Z |
| format | Article |
| id | doaj.art-0142af3ba52f4f36893382bf6553ebe1 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-22T20:24:00Z |
| publishDate | 2020-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-0142af3ba52f4f36893382bf6553ebe12022-12-21T18:13:46ZengIEEEIEEE Access2169-35362020-01-018378553786510.1109/ACCESS.2020.29745809000927Adaptive Group Routing and Scheduling in Multicast Time-Sensitive NetworksQinghan Yu0https://orcid.org/0000-0001-6901-8071Ming Gu1Key Laboratory for Information System Security (KLISS), Ministry of Education, Tsinghua University, Beijing, ChinaKey Laboratory for Information System Security (KLISS), Ministry of Education, Tsinghua University, Beijing, ChinaTraditionally, industrial networks rely on field bus to support real-time applications. In the trend of industrial internet of things (IIoT), traffic load has increased dramatically, and industrial networks are moving towards time-sensitive networking (TSN), which is based on the widely used Ethernet. In TSN, the time-triggered mechanism is a promising technology for real-time control due to its ability to provide deterministic latency and jitter guarantees. However, this mechanism is mainly based on offline computed schedules, making it difficult to satisfy dynamic requirements in data transmission of IIoT. In this paper, we propose an adaptive group routing and scheduling (AGRS) approach in multicast time-sensitive networks. The framework of this approach contains three phases including pre-processing, schedule synthesis, and post-processing phases. While the pre-processing phase first prunes unnecessary links and adaptively groups qualified complete subgraphs of the network to obtain a simplified topology, the schedule synthesis phase then jointly considers routing and scheduling processes based on the simplified topology to improve schedulability. Finally, the post-processing phase handles the scheduling results of previous phases to generate a feasible schedule. Experiments show that our approach improves schedulability by 68% and reduces execution time by 74% for multicast time-sensitive networks compared with existing approaches.https://ieeexplore.ieee.org/document/9000927/Integer linear programmingreal-time schedulingtime-sensitive networks |
| spellingShingle | Qinghan Yu Ming Gu Adaptive Group Routing and Scheduling in Multicast Time-Sensitive Networks IEEE Access Integer linear programming real-time scheduling time-sensitive networks |
| title | Adaptive Group Routing and Scheduling in Multicast Time-Sensitive Networks |
| title_full | Adaptive Group Routing and Scheduling in Multicast Time-Sensitive Networks |
| title_fullStr | Adaptive Group Routing and Scheduling in Multicast Time-Sensitive Networks |
| title_full_unstemmed | Adaptive Group Routing and Scheduling in Multicast Time-Sensitive Networks |
| title_short | Adaptive Group Routing and Scheduling in Multicast Time-Sensitive Networks |
| title_sort | adaptive group routing and scheduling in multicast time sensitive networks |
| topic | Integer linear programming real-time scheduling time-sensitive networks |
| url | https://ieeexplore.ieee.org/document/9000927/ |
| work_keys_str_mv | AT qinghanyu adaptivegrouproutingandschedulinginmulticasttimesensitivenetworks AT minggu adaptivegrouproutingandschedulinginmulticasttimesensitivenetworks |