Network Device Queue Management for Adaptive Transmission
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Data transmission in networks needs to be efficiently managed based on the target application and characteristics of the receiving station, but existing methods fail to optimize this efficiently.
Innovation Solution
A network device with multiple queues, each corresponding to different traffic classes, uses a transmission selection algorithm to reconfigure sub-queues and select data frames for transmission based on strict priority, credit-based shaper, or burst transmission algorithms, ensuring efficient data processing and energy-efficient processing at the receiving station.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional data transmission methods are used, then network connectivity is maintained, but data transmission efficiency is insufficient and cannot be optimized according to target application and receiving station characteristics
Solution Approach 1:
The patent implements dynamic transmission selection by allowing the network device to switch between different transmission algorithms (strict priority, credit-based shaper, burst transmission) based on real-time conditions. The system dynamically adjusts transmission behavior according to the characteristics of the receiving station and target application, transforming a static transmission system into an adaptive one that optimizes efficiency for different scenarios.
Solution Approach 2:
The patent changes transmission parameters by selecting different algorithms with distinct characteristics. The strict priority algorithm provides deterministic latency for real-time data, the credit-based shaper algorithm provides bandwidth guarantees, and the burst transmission algorithm provides energy efficiency. By changing these parameters based on conditions, the system optimizes transmission efficiency for different applications and receiving stations.
2Use of energy by moving object
If burst transmission algorithm is used, then energy efficiency is improved, but transmission delay increases due to queue reconfiguration and status change conditions
Solution Approach 1:
The system performs preliminary actions by pre-configuring multiple queues with different transmission algorithms and pre-establishing the burst transmission mode with sub-queues. When burst transmission is selected, the system already has the necessary queue structure in place, so it only needs to switch between pre-configured modes rather than creating structures dynamically, reducing the delay penalty of the burst transmission algorithm.
Solution Approach 2:
The patent implements dynamic queue reconfiguration where sub-queues can switch between read and write statuses based on real-time conditions. This dynamic adjustment allows the system to optimize between energy efficiency and transmission delay by changing operational states rather than restructuring the entire queue system, thereby reducing the time penalty associated with burst transmission.
3Reliability
If multiple queues with different traffic classes are implemented, then transmission priority control is improved, but device complexity increases
Solution Approach 1:
The patent segments the transmission system into multiple independent queues, each dedicated to specific traffic classes (real-time data, video data, audio data, best effort data). Each queue can operate with its own transmission algorithm and priority settings, allowing fine-grained control over different types of data. This segmentation achieves reliable priority control by physically separating different traffic flows.
Solution Approach 2:
The network device achieves multi-functionality by implementing a universal queue management framework that can handle multiple traffic classes and transmission algorithms simultaneously. The same hardware and control logic support strict priority, credit-based shaper, and burst transmission modes across different queues, reducing the need for separate dedicated systems for each function while maintaining reliable priority control.
Data Source
AI summary
A method for selecting a transmission of a network device is disclosed. In particular, a method for selecting a transmission of a network device comprising a plurality of queues for storing data frames is disclosed. Here, each of the plurality of queues corresponds to a different traffic class, the method comprising: a step of obtaining information about a transmission selection algorithm for the plurality of queues; and a step of selecting data frames for transmission from a corresponding queue on the basis of transmission selection algorithm information. Here, the transmission selection algorithm may correspond to a strict priority algorithm, a credit-based shaper algorithm, or a burst transmission algorithm.