Outbound Queue Time Slicing for Deterministic Packet Forwarding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional store-and-forward mechanisms in networks fail to guarantee deterministic delay in packet forwarding due to unpredictable delays in scheduling outbound-interface-direction queues, hindering the realization of end-to-end delay guarantees.
Innovation Solution
Implement time slicing in outbound-interface-direction queues, determining the length of one time slice based on outbound interface bandwidth and packet length, and allocating time slices to queues based on service attributes to maintain deterministic delay.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional store-and-forward mechanism is used for packet forwarding, then bandwidth utilization is improved, but deterministic delay cannot be guaranteed
Solution Approach 1:
The outbound-interface-direction queue is divided into multiple time slices, with each time slice allocated to specific queues based on service attributes. This segmentation allows predictable scheduling of packet forwarding within each time slice while maintaining overall bandwidth utilization through continuous processing across multiple slices.
Solution Approach 2:
The scheduling mechanism dynamically allocates different time slices to different outbound-interface-direction queues based on service attributes and current network conditions. This dynamic allocation enables the system to adapt to varying traffic demands while guaranteeing deterministic delay for time-sensitive services through reserved time slice allocations.
2Reliability
If time slicing is implemented in outbound-interface-direction queues, then deterministic delay is achieved, but system complexity increases
Solution Approach 1:
The scheduling mechanism operates periodically with fixed time slice durations, where each time slice is allocated to specific queues in a predetermined sequence. This periodic operation simplifies the scheduling logic compared to complex dynamic algorithms, as the system follows a regular, predictable pattern that is easier to implement and manage while still achieving deterministic delay guarantees.
Data Source
Figure 1~2
Figure 3~4
Figure 5~6
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.