TSN Data Flow Scheduling with Conflict Visualization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The complexity of scheduling data flows in time-sensitive networks (TSNs) increases with more complex topologies and dynamic links, making real-time scheduling of data flows challenging due to potential conflicts and the need for precise time synchronization.
Innovation Solution
A method and system for scheduling data flows in TSNs that identifies unscheduled flows, determines conflicts with scheduled flows, and displays information and schedules for each link, allowing for the modification of data flow requirements to eliminate conflicts and optimize transmission times.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If standard Ethernet networking is used in TSNs, then device compatibility and infrastructure sharing are improved, but scheduling complexity and time synchronization challenges increase
Solution Approach 1:
The patent segments the scheduling process into discrete, manageable components: identifying unscheduled flows, determining conflicts with scheduled flows, and displaying scheduling information. This segmentation allows complex TSN scheduling to be broken down into systematic steps that can be handled by software modules, reducing overall scheduling complexity while maintaining standard Ethernet compatibility.
Solution Approach 2:
The system performs preliminary scheduling actions by identifying unscheduled data flows before actual transmission occurs. By pre-determining conflicts and establishing schedules in advance, the system prepares the network for deterministic communication without adding runtime complexity, thus maintaining compatibility with standard Ethernet infrastructure.
2Quantity of substance
If more data flows are scheduled in complex topologies, then network coverage and functionality are improved, but scheduling time and computational resources increase
Solution Approach 1:
The scheduling system performs self-service by automatically identifying unscheduled data flows and determining conflicts with existing schedules without requiring manual intervention. This automated approach allows the system to handle increasing numbers of data flows efficiently, as the scheduling process serves itself through systematic conflict detection and resolution algorithms.
Solution Approach 2:
The system implements feedback mechanisms by displaying scheduling information including conflicts between unscheduled and scheduled flows. This feedback allows operators to monitor scheduling progress and make adjustments, enabling the system to efficiently manage large numbers of data flows through iterative optimization rather than requiring excessive computational time for initial scheduling.
3Reliability
If deterministic communication is ensured through strict scheduling, then reliability of critical functions is improved, but flexibility in handling dynamic links decreases
Solution Approach 1:
The patent applies dynamics by allowing the scheduling system to adapt to dynamic links while maintaining deterministic communication for critical functions. The system can identify and schedule unscheduled flows on dynamic topology changes, and the display of scheduling information enables operators to adjust schedules in response to changing network conditions, thus combining reliability with adaptability.
Solution Approach 2:
The system applies local quality by allowing different parts of the network to have different scheduling characteristics. Critical control and safety functions maintain strict deterministic scheduling, while other data flows can be scheduled more flexibly to accommodate dynamic links. This localized approach to scheduling quality ensures reliability where needed while maintaining flexibility elsewhere in the network.
Data Source
AI summary
A method for scheduling a transmission of data flows in a network. The method includes identifying an unscheduled set of data flows to be scheduled for a respective transmission on a subset of the set of links defining a respective path, scheduling a respective transmission of a subset of data flows on the respective path, wherein the schedule defines a start time, a duration, and a cycle time of the transmission on each respective link in the path. The method includes determining a conflict between an unscheduled data flow and a scheduled data flow with respect to a link in the path, displaying the unscheduled data flow, the link, and the scheduled data flow with which the conflict occurs, and displaying, for each scheduled data flow, an image depicting each respective link of the path, and a data transmission schedule with respect to each respective link in the path.