Packet Scheduling with Queue Countdown Timing for Deterministic Delay
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The complexity of packet scheduling in deterministic networks is increased by carrying local deadline stacks in packets to meet QoS objectives, which complicates the forwarding process.
Innovation Solution
A packet scheduling method that acquires an allowable queuing delay and sending countdown times to compare and schedule packets without the need for local deadline stacks, using forwarding queues with staggered countdown times and sub-blocks to determine scheduling priority.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If local deadline stacks are carried in packets to meet deterministic delay requirements, then QoS objectives are satisfied, but packet scheduling complexity increases
Solution Approach 1:
The patent extracts the deadline information from the packet payload (local deadline stack) and implements it as a separate forwarding queue mechanism at each network node. Each node maintains multiple forwarding queues with different countdown times, and packets are scheduled based on the countdown time of their respective queues rather than carrying deadline stacks within the packets themselves. This extraction eliminates the need for complex deadline stack operations in packet processing.
Solution Approach 2:
The patent creates a simplified copy of the deadline mechanism at each network node through local forwarding queues with countdown timers. Instead of propagating and processing complete deadline stacks through packets, each node maintains local copies of deadline information in the form of countdown times associated with different forwarding queues. This local copying approach satisfies deterministic delay requirements while avoiding the complexity of end-to-end deadline stack processing.
2Reliability
If strict explicit deterministic paths are computed to guarantee QoS, then service level agreement is met, but network flexibility and adaptability are reduced
Solution Approach 1:
The patent introduces dynamic countdown times for different forwarding queues at each network node, allowing the scheduling behavior to adapt to current network conditions while maintaining deterministic guarantees. The countdown times can be adjusted based on packet priority, queue status, and network state, enabling flexible resource allocation along the deterministic path without requiring rigid pre-computed scheduling at every node.
Solution Approach 2:
The patent segments the deterministic path into multiple forwarding queues with different countdown times at each network node. This segmentation allows different packets or packet streams to be handled by different queues with appropriate timing characteristics, providing both the deterministic guarantees of explicit paths and the flexibility of differentiated handling within the path structure.
Data Source
AI summary
Provided in the present application are a packet scheduling method, a network device, a storage medium, and a computer program product. The method comprises: acquiring an allowable queuing delay of a target packet in a shaper queue; acquiring a sending countdown time of a forwarding queue, wherein the sending countdown time comprises a first sending countdown time and a second sending countdown time, the first sending countdown time corresponding to the first sub-block in the forwarding queue, and the second sending countdown time corresponding to the last sub-block in the forwarding queue; comparing the allowable queuing delay with the first sending countdown time and the second sending countdown time, so as to obtain comparison results; and scheduling the target packet according to the comparison results.