Dynamic Priority Queue Depth Adjustment for Network Switch Memory

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing network devices allocate fixed queue depths for priority queues, leading to unused memory when network traffic is not segmented into all priority levels, rendering the unused memory unavailable for other queues.

Innovation Solution

Implementing a queue controller that dynamically adjusts the maximum depth of priority queues based on network traffic parameters, such as priority levels, to optimize performance and balance traffic delivery needs.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of manufacture

If fixed queue depths are allocated at startup, then memory allocation is simple and deterministic, but unused memory space is unavailable to other queues when not all priority levels are used

Engineering Contradiction:
Improveease of configurationVSAvoidmemory utilization
Core Design Contradiction:
Ease of manufactureVSQuantity of substance

Solution Approach 1:

The patent implements dynamic queue depth adjustment where the queue controller continuously monitors traffic patterns and modifies queue depths in real-time based on actual usage. This transforms the static fixed allocation into a dynamic system that adapts to changing traffic conditions, allowing memory to be reallocated from unused priority queues to actively used ones without requiring manual reconfiguration.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The system changes the queue depth parameter dynamically based on traffic conditions. The queue controller monitors metrics such as queue occupancy, traffic rate, and priority level utilization, then adjusts the depth parameter accordingly. This allows the same memory pool to be efficiently distributed across different priority queues based on actual demand rather than predetermined fixed allocations.

Inventive Principle:
Principle #35Parameter changes

2Stability of the object's composition

If unused allocated memory space is reserved for future use, then memory allocation is stable and predictable, but the memory cannot be reallocated to currently active priority queues

Engineering Contradiction:
Improvememory allocation stabilityVSAvoidtraffic handling efficiency
Core Design Contradiction:
Stability of the object's compositionVSProductivity

Solution Approach 1:

The queue controller implements a feedback mechanism that continuously monitors queue utilization metrics and uses this information to dynamically adjust queue depths. When a priority queue is not fully utilized, the controller detects this condition and reallocates the unused memory to other active queues, thereby improving overall traffic handling efficiency while maintaining allocation stability through controlled adaptation.

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The system performs self-service by automatically monitoring its own queue utilization and reallocating memory resources without external intervention. The queue controller autonomously detects unused memory in priority queues and redistributes it to active queues based on current traffic demands, eliminating the need for manual reconfiguration while maintaining stable and efficient operation.

Inventive Principle:
Principle #25Self-service

3Quantity of substance

If dynamic queue depth adjustment is implemented, then memory utilization is optimized, but system complexity increases due to additional control mechanisms

Engineering Contradiction:
Improvememory utilizationVSAvoidcontrol system complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent merges the queue depth control functionality into the existing queue controller that already manages packet scheduling and priority handling. By integrating the dynamic depth adjustment logic with the existing control structure, the system achieves optimized memory utilization without adding separate complex control mechanisms. The queue controller simultaneously performs scheduling decisions and memory allocation adjustments based on unified traffic state information.

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentUS8571048B2Dynamic memory queue depth algorithm
Publication Date: 2013.10.29 HEWLETT PACKARD ENTERPRISE DEV LP
  • US8571048B2 patent drawing
  • US8571048B2 patent drawing
  • US8571048B2 patent drawing

AI summary

A method of modifying a priority queue configuration of a network switch is described. The method comprises configuring a priority queue configuration, monitoring a network parameter, and adjusting the priority queue configuration based on the monitored network parameter.