Dynamic weighted round robin scheduling policy method based on priorities

A round-robin scheduling and dynamic weighting technology, applied in the field of communication and network, can solve the problems such as the inability to dynamically adjust the weight value and the lack of control ability of WRR, so as to improve the utilization rate of channel network resources, rational and efficient network resource scheduling, and high utilization rate. Effect

Inactive Publication Date: 2018-02-23
10TH RES INST OF CETC
View PDF7 Cites 54 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

When the network traffic increases, the WRR whose weight value of

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Dynamic weighted round robin scheduling policy method based on priorities
  • Dynamic weighted round robin scheduling policy method based on priorities
  • Dynamic weighted round robin scheduling policy method based on priorities

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0018] According to the present invention, for data flows of different priorities, on the basis of QoS service guarantee, the QoS requirements of high-priority services are guaranteed while the transmission fairness of low-priority services is improved, according to Based on the priority of different queue services, real-time perception of queue busyness, dynamically set queue polling weight and network characteristics, the priority-based dynamic weighted polling scheduling strategy method is divided into a queue management module and a polling scheduling module. The backbone network node in the queue management module divides all services in the network into n priority sub-queues according to the QoS index, and a cache sub-queue in each priority mapping node; after the backbone network node receives the service data packet, it According to the QoS requirement of the backbone network node, the priority of the service data packet arriving at the backbone network node is judged, ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L12/24H04L12/26H04L12/863H04L12/873H04B7/185H04L47/52
CPCH04B7/18519H04L41/0823H04L41/0896H04L41/5003H04L43/103H04L47/52H04L47/6295
Inventor 潘越张雷王继业
Owner 10TH RES INST OF CETC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products