Differentiated service-based queue scheduling method

Abstract

The invention discloses a differentiated service-based queue scheduling method Deficit Weighed Round Robin plus (DWRR+). In the method, the maximum byte count of a sent packet in once service is dynamically set according to the length of a packet in the current queue, so that the delay characteristic of a low-weight service is ensured, the relative fairness of bandwidth allocation is ensured, the defect that a low-priority queue may not be serviced for a long time is overcome, and the fact that a Deficit Weighed Round Robin plus (DWRR) algorithm cannot better met the requirement on the delay characteristic of the service is improved; a priority queue is set, and a token bucket algorithm is taken as a flow regulator, so that the priority of a real-time service is ensured; and the DWRR+ algorithm and a priority scheduling algorithm PQ are combined to serve as the scheduling strategy of a network node scheduler, so that on the premise of ensuring the priority of the real-time service and output bandwidths of other services, the time delay is reduced, and the service quality of different services can be ensured to a certain extent.

Description

technical field [0001] The invention relates to a queue scheduling method for differentiated services, and mainly studies how to realize the delay characteristics of low-weight services in a QoS-guaranteed network through technical means, and ensure the relative fairness of bandwidth allocation, avoiding the possibility of low-priority queues The disadvantage of not getting service for a long time. In general, delay and weight are contradictory parameters, how to make a balance, how to make a more reasonable choice in the network and ensure fairness is particularly important. The research result obtained by the invention is suitable for QoS network, and has important value for improving the service quality assurance of the network. Background technique [0002] Network QoS (Quality of Service) is to ensure the service requirements of different services through certain policies and mechanisms under the premise of a certain network bandwidth. Specifically, it can be quantifie...

AI Technical Summary

Problems solved by technology

[0003] At present, scholars have proposed many queue scheduling algorithms that can provide QoS guarantees, such as First In First Out (FIFO), Priority Queuing (PQ), Custom Queuing (CQ), Weighted Fair Queuing (WFQ), Class Based Weighted Fair Queuing (CBWFQ) , Weighted Round-Robin (WRR), Deficit Weighted Round-Robin (DWRR), these algorithms have not made a reasonable balance in terms of weight and delay, and rarely take both aspects into account

Images