Multi-Queue Management Using Shared Ring Buffer

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing queue management techniques in multi-access communication networks are inefficient in terms of memory usage and performance, as they either require excessive memory for separate queues or suffer from overflow issues with dynamic queue sizes.

Innovation Solution

The implementation of a multi-queue management system that uses K×N virtual queues sharing a physical ring buffer, allowing for efficient memory utilization and quality of service (QoS) guarantees for individual instances and links.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If separate queues are allocated for each instance and link, then QoS for individual instances is improved, but memory requirements increase significantly

Engineering Contradiction:

ImproveQoS guaranteeVSAvoidmemory requirements

Core Design Contradiction:

ReliabilityVSQuantity of substance

Solution Approach 1:

The patent merges K×N separate queues into a single shared physical ring buffer of size L, where multiple virtual queues logically share the same physical memory space. This combining approach reduces total memory requirements while maintaining QoS guarantees through virtual queue management and index tracking mechanisms.

Inventive Principle:

Principle #5Merging (Combining)

Solution Approach 2:

The patent segments the shared physical ring buffer into K×N virtual queues through logical partitioning using index values. Each virtual queue is identified by a unique index (combination of instance ID and link ID), allowing separate QoS management for each instance-link pair while sharing the same physical memory resource.

Inventive Principle:

Principle #1Segmentation

2Quantity of substance

If dynamic queue sizes are implemented, then memory efficiency is improved, but overflow issues occur

Engineering Contradiction:

Improvememory efficiencyVSAvoidqueue stability

Core Design Contradiction:

Quantity of substanceVSReliability

Solution Approach 1:

The patent implements dynamic queue management where the shared ring buffer can adaptively allocate space to different virtual queues based on current traffic demands. The buffer size L is fixed, but the distribution of space among K×N virtual queues is dynamic, allowing memory efficiency improvements while maintaining stability through the shared pool approach.

Inventive Principle:

Principle #15Dynamics

3Reliability

If K×N separate queues are used, then QoS for individual instances is maintained, but device complexity increases

Engineering Contradiction:

Improveinstance QoSVSAvoidqueue management complexity

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The patent creates a universal shared ring buffer that serves multiple functions: it acts as the physical storage for all K×N virtual queues, provides a common memory pool for memory efficiency, and enables unified management operations. This multi-functional design reduces device complexity by replacing K×N separate queue structures with a single shared infrastructure.

Inventive Principle:

Principle #6Universality (Multi-functionality)

Data Source

PatentUS12316550B2Multi-access management service queueing and reordering techniques

Publication Date: 2025.05.27 INTEL CORP

AI summary

The present disclosure is related to multi-queue management techniques and packet reordering techniques for inter-radio access technology (RAT) and intra-RAT traffic steering. The multi-queue management and packet reordering techniques may be used in Multi-Access Management Services (MAMS) framework, which is a programmable framework that provides mechanisms for the flexible selection of network paths in a multi-access (MX) communication environment, based on an application's needs. Other embodiments may be described and/or claimed.