Network Device Buffer Management via Threshold-Based Packet Deletion

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing network device packet queue management systems are complex and incur high overheads due to the need to manage packet queues based on packet duration, leading to inefficient resource utilization and increased packet loss rates.

Innovation Solution

A memory management method that determines when available storage space falls below a threshold, selectively deletes packets from the tail of packet queues with higher latency or length, and migrates them to a secondary memory to optimize resource usage and reduce packet loss.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If packet queues are managed based on packet duration, then packet queue management can be performed, but implementation complexity increases and overheads increase

Engineering Contradiction:
Improvepacket queue management capabilityVSAvoidimplementation complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent extracts the complex duration-based management logic and replaces it with a simpler threshold-based deletion mechanism. When available storage space falls below a threshold, packets are deleted from the tail of packet queues without requiring complex duration calculations, thereby reducing implementation complexity while maintaining packet queue management capability

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent changes the management parameter from packet duration to available storage space threshold. This parameter transformation simplifies the management logic by using a direct space threshold comparison instead of calculating and comparing packet durations, reducing both implementation complexity and overheads

Inventive Principle:
Principle #35Parameter changes

2Productivity

If packets are deleted from packet queues when memory is full, then memory utilization improves, but packet loss increases

Engineering Contradiction:
Improvememory utilizationVSAvoidpacket loss
Core Design Contradiction:
ProductivityVSLoss of substance

Solution Approach 1:

The patent performs preliminary deletion of packets from the tail of packet queues before the memory becomes completely full. By monitoring available storage space and deleting packets when space falls below a threshold, the system proactively prevents memory overflow and subsequent packet loss, thereby maintaining high memory utilization while minimizing packet loss

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent selectively discards packets from the tail of packet queues based on available storage space conditions. This controlled discarding mechanism releases memory resources for new packets while the systematic approach minimizes overall packet loss by preventing memory overflow conditions

Inventive Principle:
Principle #34Discarding and recovering

3Measurement precision

If packet queues are managed with high precision based on duration, then packet timing accuracy improves, but overheads increase

Engineering Contradiction:
Improvepacket timing accuracyVSAvoidoverheads
Core Design Contradiction:
Measurement precisionVSLoss of energy

Solution Approach 1:

The patent transforms the precision requirement from packet duration measurement to simple storage space threshold comparison. This parameter change maintains adequate timing control by using space thresholds while dramatically reducing computational overheads associated with precise duration calculations and comparisons

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS11695710B2Buffer management method and apparatus
Publication Date: 2023.07.04 HUAWEI TECH CO LTD
  • US11695710B2 patent drawing
  • US11695710B2 patent drawing
  • US11695710B2 patent drawing

AI summary

A memory management method includes: determining that available storage space of a first memory in a network device is less than a first threshold, where the first threshold is greater than 0 and the first memory stores a first packet queue; and deleting at least one packet at the tail of the first packet queue from the first memory based on the available storage space of the first memory being less than the first threshold. When the available storage space of the first memory is less than the first threshold, a packet queue, namely, the first packet queue, is selected and a packet at the tail of the packet queue is deleted from the first memory.