[Paper Review] Formal Scheduling Constraints for Time-Sensitive Networks

Silviu S. Craciunas, Ramón Serna Oliver+1 more|arXiv (Cornell University)|Sep 27, 2017

Network Time Synchronization Technologies5 references10 citations

TL;DR

This paper formalizes scheduling constraints for IEEE 802.1Qbv gate control lists in Time-Sensitive Networks (TSN), enabling deterministic communication with bounded jitter and end-to-end latency. By introducing window-based scheduling with rigorous timing constraints, the approach enhances flexibility while ensuring real-time guarantees in distributed networks.

ABSTRACT

In recent years, the IEEE 802.1 Time Sensitive Networking (TSN) task group has been active standardizing time-sensitive capabilities for Ethernet networks ranging from distributed clock synchronization and time-based ingress policing to frame preemption, redundancy management, and scheduled traffic enhancements. In particular the scheduled traffic enhancements defined in IEEE 802.1Qbv together with the clock synchronization protocol open up the possibility to schedule communication in distributed networks providing real-time guarantees. In this paper we formalize the necessary constraints for creating window-based IEEE 802.1Qbv Gate Control List schedules for Time-sensitive Networks (TSN). The resulting schedules allow a greater flexibility in terms of timing properties while still guaranteeing deterministic communication with bounded jitter and end-to-end latency.

Motivation & Objective

• To address the lack of formal constraints for creating reliable gate control list schedules in IEEE 802.1Qbv-based TSN systems.
• To enable greater scheduling flexibility while maintaining deterministic timing properties in distributed time-sensitive networks.
• To formalize timing constraints that guarantee bounded jitter and end-to-end latency in scheduled traffic.
• To support the design of scalable and verifiable TSN communication schedules across networked devices.

Proposed method

• Formalization of window-based scheduling constraints for IEEE 802.1Qbv gate control lists.
• Definition of timing constraints that ensure frame transmission within predictable time windows.
• Integration of these constraints with IEEE 802.1Qbv's time-regular traffic scheduling mechanism.
• Use of distributed clock synchronization to align scheduling windows across network nodes.
• Specification of conditions under which frame preemption and redundancy do not disrupt scheduled timing.
• Construction of a constraint model that supports verification of deterministic communication behavior.

Experimental results

Research questions

• RQ1 What formal constraints are necessary to ensure deterministic communication in IEEE 802.1Qbv-based TSN networks?
• RQ2 How can scheduling flexibility be increased without compromising bounded jitter and end-to-end latency?
• RQ3 What conditions must be met to guarantee correct operation of gate control lists across distributed network nodes?
• RQ4 How do clock synchronization and frame preemption interact with scheduled traffic under formal timing constraints?

Key findings

• The proposed formal constraints enable the creation of window-based gate control list schedules that ensure deterministic communication in TSN.
• The method supports greater scheduling flexibility while maintaining bounded jitter and end-to-end latency.
• The constraints are compatible with existing IEEE 802.1Qbv and IEEE 802.1AS clock synchronization mechanisms.
• The formal model allows for verification of timing guarantees across distributed network nodes.