Cyclic Scheduling for Jitter-Free Data Packet Transfers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional switched network scheduling methods introduce significant jitter at high traffic loads, failing to meet stringent jitter constraints required for reliable operation in fault-tolerant network architectures.
Innovation Solution
A method for constructing a cyclic schedule that ensures jitter-free data packet transfers by synchronizing data packets with periodic processing schedules, using a scheduler to arrange packets in a non-preemptive, static order that satisfies network communication standards.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If traditional switched network scheduling methods place data packets in a typical data queue, then the network can operate with simple scheduling logic, but significant jitter is introduced into the network at high traffic loads
Solution Approach 1:
The patent implements a cyclic scheduling mechanism where data packets are transmitted in periodic cycles with fixed time slots assigned to different traffic classes. This periodic structure ensures that high-priority packets are transmitted at predictable intervals, eliminating jitter while maintaining manageable scheduling complexity through the regular, repeating pattern of the cyclic schedule.
Solution Approach 2:
The patent segments the data queue into multiple priority levels (high-priority and low-priority queues) and applies different scheduling strategies to each segment. High-priority packets are handled through the cyclic scheduling mechanism to guarantee jitter-free transmission, while low-priority packets use traditional queuing, thus resolving the contradiction by applying complexity only where necessary for reliability.
2Productivity
If traditional switched network scheduling methods are used to handle high traffic loads, then the network can maintain high throughput, but stringent jitter constraints are not met
Solution Approach 1:
The patent applies different quality levels of service to different traffic classes within the same network. High-priority traffic receives jitter-free guaranteed service through cyclic scheduling with dedicated time slots, while low-priority traffic accepts best-effort service. This local differentiation allows the network to meet precise jitter constraints for critical traffic while maintaining high overall throughput.
Solution Approach 2:
The patent applies the complex cyclic scheduling mechanism partially - only to high-priority packets that require jitter constraints to be met. Low-priority packets are handled with simpler queuing mechanisms. This partial application of the rigorous scheduling approach maintains throughput efficiency while ensuring precision where absolutely necessary.
3Reliability
If a cyclic schedule is constructed to ensure each data packet transfer is substantially free of jitter, then jitter constraints are satisfied, but the scheduling complexity increases
Solution Approach 1:
The cyclic schedule is constructed in advance during system initialization or configuration phases, rather than being dynamically computed in real-time during packet transmission. This preliminary construction allows complex scheduling decisions to be made offline, reducing the computational complexity required during actual packet handling while still ensuring jitter-free transmission through the pre-planned cyclic structure.
Data Source
AI summary
A method for scheduling one or more data packet transfers over a computer-based distributed network is disclosed. The method involves constructing a cyclic schedule from a plurality of data packets, wherein the cyclic schedule is constructed to ensure that each data packet transfer is substantially free of jitter. The method further involves synchronizing the cyclic schedule with at least one periodic processing schedule and transmitting the synchronized data packets as arranged by the cyclic schedule.