Dynamic weighted round robin scheduling policy method based on priorities

Abstract

The invention provides a dynamic weighted round robin scheduling policy method based on priorities. Through utilization of the method, a network resource utilization rate is high, bandwidth resource allocation is fair and network resource scheduling is reasonable and efficient. The method is realized through adoption of the following technical scheme that for data streams of different priorities,the dynamic weighted round robin scheduling policy method based on the priorities comprises a queue management module and a round robin scheduling module; the queue management module divides all business in a network into sub-queues of n priorities; after backbone network nodes receive business data packets, the priorities of the data packets arriving at the backbone network nodes are judged according to QoS demands of the business, and the business data packets are inserted into the corresponding cache sub-queues according to the priorities; the round robin scheduling module carries out periodic round robin; and the busy degree of each sub-queue is calculated according to the current queue lengths Q of the sub-queues, the busy degree is arranged, round robin weight values of the sub-queues are dynamically adjusted according to a busy degree arrangement result, the round robin is carried out on each sub-queue in sequence, and the data packets are sent.

Description

technical field [0001] The invention belongs to the technical field of communication and network, in particular to a priority-based dynamic weighted round-robin scheduling policy method. Background technique [0002] One of the development trends of the future communication network is to evolve towards an integrated space-ground network. The network mainly includes image 3 As shown, it consists of a space-based satellite network, a ground-based backbone network, various communication subnets, and users. With the rapid development of science and technology, the business volume in the network is also growing explosively, and different services have different requirements in terms of delay, packet loss rate and other performance. However, network resources are always limited. In the case of a fixed total network bandwidth, if a certain type of service occupies more bandwidth, then other services can use less bandwidth, which may affect the use of other services. Based on this...

AI Technical Summary

Problems solved by technology

When the network traffic increases, the WRR whose weight value of each queue cannot be adjusted dynamically lacks the control ability

Images