HQoS Queue Scheduling With Software-Defined Mapping

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional HQoS scheduling trees implemented by traffic management (TM) hardware entities result in fixed mapping relationships, leading to inflexible queue management and resource wastage, as they cannot adapt to actual transmission requirements without replacing the hardware.

Innovation Solution

Implementing the HQoS scheduling tree using software, allowing flexible management of queue mappings and reducing resource waste by generating a tree structure with software-defined nodes that can change their relationships without needing hardware replacements.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If HQoS scheduling tree is implemented by TM hardware entity, then scheduling function is provided, but mapping relationship between hierarchies is fixed and flexible management cannot be implemented

Engineering Contradiction:
Improveflexible queue managementVSAvoidhardware replacement requirement
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent replaces the hardware-based hierarchical mapping mechanism with a software-based control mechanism. The CPU generates HQoS scheduling trees and sends control information to the TM hardware entity, allowing flexible queue management without hardware replacement. This substitution of mechanical/hardware system with software control system resolves the contradiction between adaptability and device complexity.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

Solution Approach 2:

The patent introduces dynamic control of the scheduling tree structure through software. The CPU can dynamically generate and modify the HQoS scheduling tree based on actual transmission requirements, and the TM hardware entity can dynamically adjust queue mappings according to control information. This dynamic mechanism enables flexible management without requiring physical hardware changes.

Inventive Principle:
Principle #15Dynamics

2Adaptability or versatility

If fixed mapping relationship is used in TM hardware entity, then implementation is simple, but actual transmission requirement cannot be met

Engineering Contradiction:
Improvetransmission requirement adaptationVSAvoidimplementation complexity
Core Design Contradiction:
Adaptability or versatilityVSEase of manufacture

Solution Approach 1:

The patent segments the scheduling control function into two parts: the CPU responsible for generating the HQoS scheduling tree and determining control parameters, and the TM hardware entity responsible for executing the scheduling based on received control information. This segmentation allows the hardware to remain simple while the software provides adaptability to actual transmission requirements.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces control information as an intermediary between the CPU and the TM hardware entity. The CPU generates control information containing scheduling parameters and tree structure, which is then transmitted to the TM hardware entity for implementation. This intermediary mechanism enables the system to adapt to changing transmission requirements without modifying the hardware structure.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Adaptability or versatility

If TM hardware entity is replaced to achieve flexible management, then queue management flexibility is improved, but resources are wasted

Engineering Contradiction:
Improvequeue management flexibilityVSAvoidhardware resource waste
Core Design Contradiction:
Adaptability or versatilityVSLoss of substance

Solution Approach 1:

The patent creates a software-based copy or representation of the hierarchical scheduling structure in the form of an HQoS scheduling tree data structure. This software representation allows flexible queue management by simulating the hardware-based hierarchy control, thereby avoiding the need to replace physical hardware resources while achieving the desired flexibility.

Inventive Principle:
Principle #26Copying

Solution Approach 2:

The patent substitutes the mechanical/hardware-based hierarchy control with a software-based control system. The CPU generates scheduling trees and control information that replaces the need for hardware reconfiguration, enabling flexible queue management without wasting hardware resources on replacement.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

4Adaptability or versatility

If software-based HQoS scheduling tree is implemented, then flexible queue management is achieved, but scheduling resources on TM hardware entity need to be reduced

Engineering Contradiction:
Improvequeue management flexibilityVSAvoidscheduling resource allocation
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent extracts the hierarchical scheduling control function from the TM hardware entity and relocates it to the CPU. The CPU is responsible for generating the HQoS scheduling tree and determining control parameters, while the TM hardware entity only executes the scheduling based on received control information. This extraction reduces the scheduling resource requirements on the TM hardware entity while maintaining flexible queue management capability.

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS12375419B2HQoS queue scheduling method, apparatus, and system
Publication Date: 2025.07.29 HUAWEI TECH CO LTD
  • US12375419B2 patent drawing
  • US12375419B2 patent drawing
  • US12375419B2 patent drawing

AI summary

A queue scheduling method, apparatus, and system are provided, to flexibly manage a queue, meet an actual transmission requirement, and reduce resources. The queue scheduling method implemented by a processing apparatus includes: generating an HQoS scheduling tree including a plurality of leaf nodes, each of which identifies a queue on a traffic management (TM) hardware entity including a plurality of queues; obtaining traffic characteristics of the plurality of queues based on the plurality of leaf nodes; determining a scheduling parameter of at least one queue in the plurality of queues based on the traffic characteristics which are of data flows transmitted by the plurality of queues; sending to a scheduling apparatus a scheduling message corresponding to the at least one queue in the TM hardware entity, including the scheduling parameter of the at least one queue used to schedule the at least one queue.