HQoS queue scheduling method, apparatus, and system

A queue scheduling method, wherein the method is applied to a scheduling apparatus of a traffic management (TM) hardware entity, the TM hardware entity further comprises a plurality of queues, and the method comprises:

• receiving, by the scheduling apparatus, a scheduling message from a processing apparatus, wherein the scheduling message comprises a scheduling parameter of at least one queue in the plurality of queues, and the TM hardware entity does not comprise the processing apparatus;
• scheduling, by the scheduling apparatus, the at least one queue based on the scheduling parameter of the at least one queue;
• wherein the scheduling parameter is determined based on traffic characteristics of the plurality of queues and a scheduling parameter of at least one branch node;
• wherein the scheduling parameter of the at least one branch node is determined based on traffic characteristic of the at least one branch node and a scheduling parameter of a root node;
• wherein the traffic characteristic of the at least one branch node is determined based on the traffic characteristics of the plurality of queues:
• wherein the root node and the at least one branch node corresponding to the root node are comprised in a hierarchical quality of service (HQoS) scheduling tree generated by the processing apparatus;
• and wherein each of the at least one branch node corresponds to one or more leaf nodes of the HQOS scheduling tree, and different branch nodes correspond to different leaf nodes.

A processing apparatus comprising:

• a memory comprising processor-executable instructions;
• and
• a processor in communication with the memory, wherein the processor is configured to execute the processor-executable instructions to facilitate the processing apparatus to:
• generate a hierarchical quality of service (HQOS) scheduling tree, wherein the HQOS scheduling tree is used to describe a tree structure of a node participating in scheduling in a communication network, the HQOS scheduling tree comprises a plurality of leaf nodes, a root node and at least one branch node corresponding to the root node,
• wherein each of the plurality of leaf nodes is used to identify a queue on a traffic management (TM) hardware entity,
• wherein each of the at least one branch node corresponds to one or more leaf nodes, and different branch nodes correspond to different leaf nodes,
• wherein the TM hardware entity comprises a plurality of queues, and the plurality of leaf nodes and the plurality of queues are in a one-to-one correspondence;
• obtain traffic characteristics of the plurality of queues based on the plurality of leaf nodes;
• determine a scheduling parameter of at least one queue in the plurality of queues based on the traffic characteristics of the plurality of queues, including:
• determining, a traffic characteristic of the at least one branch node based on the traffic characteristics of the plurality of queues;
• determining, a scheduling parameter of the at least one branch node based on the traffic characteristic of the at least one branch node and a scheduling parameter of the root node;
• and
• determining, the scheduling parameter of the at least one queue in the plurality of queues based on the traffic characteristics of the plurality of queues and the scheduling parameter of the at least one branch node;
• wherein the traffic characteristics of the plurality of queues are traffic characteristics of data flows transmitted by the plurality of queues;
• and
• send a scheduling message to a scheduling apparatus corresponding to the at least one queue in the TM hardware entity, wherein the scheduling message comprises the scheduling parameter of the at least one queue, and the scheduling parameter is used to schedule the at least one queue.