Deterministic Packet Scheduling Across Adjacent Cycles
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current deterministic transmission solutions face low resource utilization due to differing duty cycles of scheduling queues and cycles caused by planning, topology changes, and traffic variations, leading to inefficient use of network devices.
Innovation Solution
A message transmission method that associates a scheduling cycle with at least one scheduling queue, allowing messages in a first scheduling queue to be forwarded using both the first and an adjacent second scheduling cycle, balancing message output and improving resource utilization by sharing buffered messages across cycles.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a scheduling queue and scheduling cycle are specified in advance for deterministic flow mapping, then deterministic transmission is achieved, but resource utilization of the network device becomes low due to different duty cycles of different scheduling queues and cycles
Solution Approach 1:
The patent makes the scheduling system dynamic by allowing a scheduling queue to be associated with multiple scheduling cycles and enabling flexible selection of target scheduling cycles based on real-time buffered message quantities. This dynamic association and selection mechanism resolves the contradiction by adapting the rigid predetermined scheduling to actual traffic conditions, thereby maintaining deterministic transmission while improving resource utilization.
Solution Approach 2:
The patent segments the scheduling process into multiple independent scheduling cycles and allows a single scheduling queue to be mapped to multiple segments (scheduling cycles). This segmentation enables flexible allocation and selection of target scheduling cycles based on real-time conditions, resolving the contradiction between predetermined scheduling requirements and dynamic resource utilization needs.
2Adaptability or versatility
If the duty cycles of different scheduling queues and scheduling cycles are kept different to accommodate planning and topology changes, then adaptability is improved, but resource utilization becomes low
Solution Approach 1:
The patent makes scheduling cycles universal by allowing multiple scheduling queues to share the same scheduling cycle and enabling a scheduling queue to be associated with multiple scheduling cycles. This multi-functional association mechanism allows the system to adapt to different duty cycles and topology changes while improving resource utilization through shared cycle usage, resolving the contradiction between adaptability and resource efficiency.
3Device complexity
If messages are forwarded only in their associated scheduling cycle, then scheduling simplicity is maintained, but message output becomes unsmooth and resource utilization is low
Solution Approach 1:
The patent introduces dynamic target scheduling cycle selection based on real-time buffered message quantities. When the buffered quantity exceeds a threshold, the system dynamically selects a different target scheduling cycle for forwarding, making the scheduling process adaptive rather than static. This dynamic approach smooths message output and improves resource utilization without significantly increasing scheduling complexity.
Solution Approach 2:
The patent introduces a target scheduling cycle selection mechanism that acts as an intermediary between the scheduling queue and the actual forwarding process. This intermediary layer dynamically determines which scheduling cycle should be used based on buffered message quantities, smoothing message output and improving resource utilization while maintaining relative simplicity in the underlying scheduling structure.
Data Source
Figure 1~2
Figure 3~6
Figure 7~9
AI summary
The present disclosure relates to a message transmission method, apparatus, a network device and a storage medium, which relates to the field of communication technology and are applied to a network device. The method comprises: monitoring a scheduling cycle, wherein one scheduling cycle is associated with at least one scheduling queue; forwarding a deterministic message buffered in a first scheduling queue having a preset identifier when it is monitored that a target scheduling cycle is reached, the target scheduling cycle comprising a first scheduling cycle associated with the first scheduling queue and a second scheduling cycle adjacent to the first scheduling cycle. By applying the technical solution provided by examples of the present disclosure, resource utilization of the network device can be improved.