Time-Synchronized Network Flow Scheduling Controller
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current communication networks face challenges in efficiently scheduling deterministic flows to minimize worst-case queuing delays and ensure high throughput, particularly in time-synchronized networks where packet arrivals follow fixed schedules and require deterministic delivery.
Innovation Solution
A controller in the time-synchronized network determines start time assignments for data flows by selecting time slots that minimize queuing delays, using algorithms such as randomized, greedy, random-greedy, and local-greedy methods to partition flows into groups and assign start times, ensuring contention-free schedules.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If time slots are assigned to data flows to enable deterministic transmission, then transmission scheduling is achieved, but queuing delays occur when multiple flows contend for the same time slot
Solution Approach 1:
The patent segments the set of data flows into multiple groups based on their time slot requirements. By dividing flows into groups that can be scheduled in different time periods, the system eliminates contentions and ensures deterministic delivery without queuing delays. This segmentation approach directly resolves the contradiction by organizing flows so that each group receives dedicated time slots.
Solution Approach 2:
The patent dynamically assigns time slots to different flow groups based on their arrival times and requirements. The system adapts the scheduling by determining which flows can be grouped together and assigning appropriate time slots, thereby eliminating contentions and reducing queuing delays while maintaining deterministic transmission guarantees.
2Productivity
If multiple data flows share common paths in the network, then network resource utilization increases, but packet collisions occur at shared switches
Solution Approach 1:
The patent segments data flows into groups that are scheduled in different time periods. By assigning time slots such that flows sharing common paths are transmitted at different times, the system eliminates packet collisions at shared switches while maintaining high network throughput. This temporal segmentation resolves the contradiction between resource utilization and collision avoidance.
Solution Approach 2:
The patent implements periodic scheduling where different flow groups are transmitted in alternating time periods. This periodic action ensures that flows sharing common network paths do not transmit simultaneously, eliminating packet collisions while maintaining efficient network resource utilization through systematic time-based multiplexing.
3Reliability
If start time assignments are determined using complex algorithms like integer linear programming, then optimal scheduling is achieved, but computational complexity and processing time increase
Solution Approach 1:
The patent segments the scheduling problem into simpler subproblems by dividing flows into groups and assigning time slots iteratively. This segmentation approach eliminates the need for complex integer linear programming while achieving optimal or near-optimal scheduling. The system processes flows in manageable groups, reducing computational complexity while maintaining scheduling reliability.
Solution Approach 2:
The patent uses dynamic, iterative algorithms that adaptively assign time slots based on flow characteristics and network conditions. This dynamic approach replaces static complex optimization problems with flexible iterative processes that achieve optimal scheduling without requiring intensive computational resources, thereby reducing device complexity while maintaining scheduling optimality.
Data Source
AI summary
Various example embodiments for supporting scheduling of deterministic flows in time synchronized networks are presented. Various example embodiments for supporting scheduling of deterministic flows in a time synchronized network may be configured to support scheduling of deterministic flows in the time synchronized network based on assignment of transmission start times to data flows of communication devices such that the communication devices may transmit data of the data flows at the transmission start times in a manner tending to reduce or eliminate collisions in the time synchronized network.