Abstract
IEEE Time-Sensitive Networking (TSN) Task Group specifies a series of standards such as 802.1Qbv for enhancing the management of time-critical flows in real-time networks. Under the IEEE 802.1Qbv standard, the scheduling algorithm is employed to determine the time when a specific gate in the network entities is opened or closed so that the real-time requirements for the flows are guaranteed. The computation time of this scheduling algorithm is critical for the system where dynamic network configurations and settings are required. In addition, the network routing where the paths of the flows are determined has a significant impact on the computation time of the network scheduling. This paper presents a novel scheduling-aware routing algorithm to minimize the computation time of the scheduling algorithm in network management. The proposed routing algorithm determines the path for each time-triggered flow by including the consideration of the period of the flow. This decreases the occurrence of path-conflict during the stage of network scheduling. The detailed outline of the proposed algorithm is presented in this paper. The experimental results show that the proposed routing algorithm reduces the computation time of network scheduling by up to 30% and improves the schedulability of time-triggered flows is the network.
Highlights
In industrial environments, time-critical tasks such as real-time monitoring and periodic flows of control applications need to be transmitted, processed and responded in a time-guaranteed manner [1,2].From the perspective of network transmissions, the delay of these time-critical flows needs to be confined within a pre-determined bound; otherwise, catastrophic consequences such as the loss of important messages or the damages of production facilities could take place [3,4]
The experimental results show that the proposed routing algorithm reduces the computation time of network scheduling by up to 30% and improves the schedulability of time-triggered flows is the network
It is noted that the scheduling algorithm used in our experiments is based on the approach shown in [10] with additional frame constraints which introduce extra limits
Summary
Time-critical tasks such as real-time monitoring and periodic flows of control applications need to be transmitted, processed and responded in a time-guaranteed manner [1,2].From the perspective of network transmissions, the delay of these time-critical flows needs to be confined within a pre-determined bound; otherwise, catastrophic consequences such as the loss of important messages or the damages of production facilities could take place [3,4]. The IEEE Time-Sensitive Networking (TSN) task group strives for the standardized enhancements of the deterministic real-time networks [6,7]. 802.1Qbv standard specifies the enhancements of real-time responses for the time-triggered flows [8,9]. The IEEE Time-Sensitive Networking (TSN) 802.1Qbv standard specifies the real-time responses for the time-triggered flows [5,6,7,8,9]. In the subsequent scheduling stage, the scheduling algorithm is performed to decide on the timing schedule for the openness and closeness of the time-controlled gates in the TSN switches along the pre-determined paths [5,9,10]. This is known as the schedulability issue for the scheduling of the network
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
