Packet Forwarding Queue Scheduling for Deterministic Delay
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional store-and-forward mechanisms in networks fail to guarantee deterministic delay in packet forwarding, making it difficult to meet the requirement of end-to-end delay consistency.
Innovation Solution
Implement time slicing in outbound-interface-direction-queue scheduling to determine the length of one time slice and the number of time slices in the scheduling period based on outbound interface bandwidth and designated packet length, allocating these slices to queues according to service attributes to ensure deterministic delay.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If store-and-forward mechanism is used for packet forwarding, then bandwidth utilization is improved, but deterministic delay cannot be guaranteed
Solution Approach 1:
The patent segments the outbound interface direction queue scheduling period into multiple time slices, with each time slice allocated to specific queues based on service attributes. This segmentation allows different packets to be scheduled in dedicated time slots, ensuring deterministic delay while maintaining high bandwidth utilization through efficient queue management.
Solution Approach 2:
The patent implements periodic scheduling by dividing the outbound interface direction queue scheduling period into multiple periodic time slices. Each time slice is periodically allocated to different queues, creating a rhythmic scheduling pattern that guarantees deterministic delay bounds while continuously utilizing the bandwidth resource.
2Device complexity
If conventional store-and-forward mechanism is used, then packet forwarding simplicity is maintained, but end-to-end delay consistency deteriorates
Solution Approach 1:
The patent introduces dynamic time slice allocation to the outbound interface direction queue scheduling, where the scheduling period is divided into multiple time slices that are dynamically assigned to different queues based on service attributes. This dynamic approach maintains operational simplicity while achieving precise end-to-end delay consistency through structured scheduling control.
3Reliability
If time slicing is implemented in outbound-interface-direction-queue scheduling, then deterministic delay is achieved, but scheduling complexity increases
Solution Approach 1:
The scheduling period is segmented into discrete time slices, with each slice allocated to specific queues based on service attributes. This segmentation transforms the complex continuous scheduling problem into manageable discrete time slot allocations, achieving deterministic delay while controlling scheduling complexity through structured division.
Solution Approach 2:
The patent changes the scheduling parameter from continuous time allocation to discrete time slice allocation. By defining specific time slice lengths and allocation patterns based on service attributes, the system achieves deterministic delay guarantees while managing complexity through parameterized scheduling rules rather than complex real-time decisions.
Data Source
AI summary
The embodiments of the present disclosure provide a packet forwarding method, a packet forwarding apparatus, and an electronic device. In the embodiments of the present disclosure, by setting up a corresponding outbound-interface-direction-queue scheduling period for the outbound interface on the network device, a number of time slices in the outbound-interface-direction-queue scheduling period, and a length of one time slice, and allocating corresponding time slices in the outbound-interface-direction-queue scheduling period to the outbound-interface-direction queues corresponding to the outbound interface, such that the network device can schedule, on each time slice in the outbound-interface-direction-queue scheduling period, packets in the outbound-interface-direction queue corresponding to the time slice. This can realize that the delay of waiting for scheduling outbound-interface-direction queues is maintained between the worst delay and the best delay as discussed above, realize deterministic delay of waiting for scheduling outbound-interface-direction queues, and thus realize deterministic delay of packet forwarding.