Queue scheduling method and system

Abstract

Disclosed are a queue scheduling method and system. The method comprises: selecting a position of a current scheduling pointer, and outputting a queue in a sub-scheduling unit at the position of the current scheduling pointer once; determining whether a start pointer camps; when it is determined that the start pointer camps, moving the start pointer to the position of the current scheduling pointer, and when it is determined that the start pointer does not camp, moving the start pointer to a position of a sub-scheduling unit following the position of the current scheduling pointer along a direction from the position of the start pointer to a position of a tail pointer; and after moving the start pointer, picking a position of a next scheduling pointer, and outputting a queue in a sub-scheduling unit at the position of the next scheduling pointer once. The method is capable of implementing flexible scheduling based on the queue situation of sub-scheduling units to be scheduled, so as to solve the problems of flow jitter and scheduling unevenness during RR pooling scheduling as well as the deterioration of the quality of service resulting from the scheduling unevenness in the prior art.

Description

technical field [0001] The present application relates to the technical field of communications, in particular to a queue scheduling method and system. Background technique [0002] QOS (quality of service) means that in the process of network communication, network equipment needs to ensure that users can obtain predictable service levels in terms of packet loss rate, delay, jitter and bandwidth. This feature is very important for operators to allocate network resources, refine service levels, and improve operating profits. The TM (Traffic management, queue management) chip in the network, as a chip for managing user bandwidth, is responsible for scheduling all user queues, and its scheduling algorithm has an important impact on the performance of QOS services. [0003] The existing scheduling algorithm maintains two tables, namely: active table and appending table. The scheduling process is as follows figure 1 As shown, for the scheduling units in the active table, each ...

AI Technical Summary

Problems solved by technology

[0009] In view of this, the embodiment of the present application provides a queue scheduling method and system, which can perform flexible scheduling according to the queue conditions of the sub-scheduling units to be scheduled, so as to solve the existing problems of traffic jitter and scheduling inconsistencies when RR round-robin scheduling is used. Uniformity and the problem of poor quality of service due to uneven scheduling

Images