Effective Routing and Scheduling Strategies for Fault-Tolerant Time-Sensitive Networking
- Authors
- Min, Junhong; Kim, Woongsoo; Paek, Jeongyeup; Govindan, Ramesh
- Issue Date
- Mar-2024
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- Compounds; IEEE 802.1CB FRER; IEEE 802.1Qbv; Job shop scheduling; Logic gates; Reliability; Reliability; Routing; Routing; Schedules; Scheduling; System recovery; Time-Sensitive Network; TSN
- Citation
- IEEE Internet of Things Journal, v.11, no.6, pp 11008 - 11020
- Pages
- 13
- Journal Title
- IEEE Internet of Things Journal
- Volume
- 11
- Number
- 6
- Start Page
- 11008
- End Page
- 11020
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/72681
- DOI
- 10.1109/JIOT.2023.3328626
- ISSN
- 2327-4662
- Abstract
- Time-Sensitive Networking (TSN) Task Group of the IEEE proposed the frame replication and elimination for reliability (FRER) technique to guarantee reliable transmissions in TSN for the emerging industrial Internet of things (IIoT). FRER is a technique that manages the replication and elimination of frames of a stream sent through multiple paths as member streams. However, the standard does not specify how to find and select the multiple paths to send the replicated member streams on, nor how the time-aware shaper (TAS) should be scheduled considering frame elimination. Most prior work on routing or TAS scheduling in TSN do not consider FRER. Conversely, studies on FRER do not address the routing and scheduling issues effectively. In this paper, we propose multipath routing and TAS scheduling strategies to support FRER in TSN with reduced complexity. We also identify a scheduling deadlock problem due to the unique characteristics of FRER, and propose a solution using topological sorting. Then, we propose two metaheuristic optimizers to increase the TAS scheduling success rate. Through extensive evaluation against state-of-theart prior work, we show that our strategies can support more flows with reduced utilization and enhanced schedulability while effectively handling the complexity of routing and scheduling problems for FRER. IEEE
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/72681)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.