Packet Dequeue Rate Determination via Merged Memory Descriptor
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Network devices face inefficiencies in determining packet dequeue rates, leading to low storage resource utilization and high access overheads due to the need for separate memory allocation for packet lengths, which results in wasted storage resources and reduced processing efficiency.
Innovation Solution
A method and apparatus that allocate consecutive blocks in a memory to store both packets and their lengths, allowing for the determination of dequeue rates based on the span between enqueue and dequeue times, thereby eliminating the need for additional memory for packet lengths and improving memory access efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If separate memory is allocated to store packet lengths, then packet dequeue rate can be determined, but storage resource utilization decreases
Solution Approach 1:
The patent merges the storage of packet data and packet length information into a single memory structure. Specifically, it uses packet descriptor structures that contain length fields, allowing both packet metadata and length information to be stored together in the same memory location, thereby eliminating the need for separate memory allocation and improving storage utilization
Solution Approach 2:
The packet descriptor structure serves multiple functions: it stores packet length information, packet metadata, and enables dequeue rate calculation. This multi-functional approach eliminates the need for dedicated separate memory for length storage, as the descriptor structure universally handles both packet management and measurement tasks
2Measurement precision
If separate memory is allocated to store packet lengths, then packet dequeue rate can be determined, but access overhead increases
Solution Approach 1:
By merging length storage with packet descriptor storage in the same memory location, the system eliminates the need for separate memory access operations. The descriptor structure contains both packet identification and length information, allowing simultaneous retrieval of both pieces of data in a single memory access, thereby reducing access overhead
Solution Approach 2:
The packet length information is pre-calculated and stored within the packet descriptor structure at the time of packet enqueueing. This preliminary action ensures that when dequeue rate determination is needed, the length information is already available in the descriptor without requiring additional memory access or calculation operations
3Measurement precision
If packet lengths are stored in separate memory, then dequeue rate calculation is possible, but device complexity increases
Solution Approach 1:
The patent combines multiple data elements (packet pointer, length, metadata) into a unified packet descriptor structure. This merging simplifies memory management by providing a single, organized structure that contains all necessary information for dequeue rate calculation, eliminating the complexity of managing separate memory allocations for different packet attributes
Data Source
Figure 1~2
Figure 3~4
Figure 5~6
AI summary
This application provides a method for determining a packet dequeue rate. The method includes: allocating a plurality of consecutive blocks in a first memory to a first packet; storing the first packet and a first length in the plurality of blocks, where the first length is a length that is of a first packet queue and that is obtained when the first packet is enqueued into the first packet queue; and determining, based on a first span and the first length stored in the plurality of blocks, a first rate at which a packet in the first packet queue is dequeued, where the first span is equal to a difference between a second time and a first time, the first time is a time at which the first packet is enqueued into the first packet queue, and the second time is a time at which the first packet is dequeued from the first packet queue. In addition, a corresponding apparatus is further provided. In the foregoing solution, storage resources are saved, and utilization of a memory is improved.