Hierarchical weighted round-robin (WRR) scheduling device and method

A weighted polling and scheduling device technology, applied in the field of communication, can solve the problems of limiting network service quality, network performance, increasing network construction costs, and low link utilization, so as to improve network performance and network service quality, and reduce network traffic. Construction cost, the effect of avoiding network congestion

Active Publication Date: 2017-12-15
WUXI VOCATIONAL & TECHN COLLEGE
View PDF4 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] RR method, which polls all queues in a fair manner, users use shared resources fairly, and cannot reflect the difference in service level between different priority queues;
[0006] In the WRR method, according to the priority of each queue, different weights are assigned to each queue, so that high-priority queues can get better services and avoid low-priority queues from occupying too much network bandwidth; however, each queue in WRR The weight value of the queue is fixedly allocated and cannot be adjusted dynamically with the arrival of business, so it may lead to low link utilization and poor flexibility
[0007] The ERR method a

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
  • Hierarchical weighted round-robin (WRR) scheduling device and method
  • Hierarchical weighted round-robin (WRR) scheduling device and method
  • Hierarchical weighted round-robin (WRR) scheduling device and method

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0070] Example 1

[0071] Reference attached figure 2 , Hierarchical weighted round-robin scheduling method, its implementation steps are as follows:

[0072] Step 1. Assign weight coefficients to each queue DC i :

[0073] 1a) Let's share P Priority, then each priority corresponds to a queue, a total of P Sub-queues

[0074] 1b) Let a scheduling period be N Time slots or packets with priority i The queue is Q i At every N Time slot counts the number of packets backlogged in the queue as N i ;

[0075] 1c) Calculation P The total number of backlog packets in each sub-queue is N all , which is ;

[0076] 1d) Calculate the weight coefficient of each priority w i , ;

[0077] 1e) Store the weight coefficient of each priority in the weight coefficient storage module, and the weight coefficient storage module is for each priority queue Q i Maintain a weight coefficient counter DC i , At the beginning of each scheduling period DC i = w i .

[0078] Step 2: Determine the scheduling mode th...

Example Embodiment

[0102] Example 2

[0103] Reference attached image 3 In this embodiment, the system provides a total of 4 priority levels. A FIFO queue is maintained for each priority service. The scheduling period is N = 8, priority 0 is the highest, priority 1 is the second, and so on; in this embodiment, the number of backlog packets in the 0th priority queue is 4, the number of backlog packets in the first priority queue is 8, and the second The number of backlog packets in the priority queue is 2, and the number of backlog packets in the third priority queue is 2. The specific steps are as follows:

[0104] Step 1. Assign weight coefficients to each queue DC i :

[0105] The number of backlog packets in each priority queue is obtained through statistics, and the weight coefficients of each priority service are obtained according to the weight coefficient calculation method as follows: w 0 = 2, w 1 = 4 ,w 2 = 1, w 3 = 1; the obtained weight coefficient is assigned to the weight coefficien...

Example Embodiment

[0124] Example 3

[0125] Reference attached Figure 4 In this embodiment, the system provides a total of 4 priority levels. A FIFO queue is maintained for each priority service. Priority 0 is the highest, priority 1 is the second, and so on; scheduling cycle N = 8, in this embodiment, the number of backlog packets in the 0th priority queue is 2, the number of backlog packets in the first priority queue is 6, the number of backlog packets in the second priority queue is 6, and the number of backlog packets in the third priority queue The number of backlog groups is 2. The specific steps are as follows:

[0126] Step 1. Assign weight coefficients to each queue DC i :

[0127] The number of backlog packets in each priority queue is obtained through statistics, and the weight coefficients of each priority service are obtained according to the weight coefficient calculation method as follows: w 0 = 1, w 1 = 3 ,w 2 = 3, w 3 = 1; the obtained weight coefficient is assigned to the wei...

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 hierarchical weighted round-robin (WRR) scheduling device and method. The hierarchical WRR scheduling device comprises a first in first out (FIFO) cache queue module, a flow statistics module, a weight management module, and a scheduling control module, wherein the weight management module comprises a weight coefficient calculation sub-module, and a weight coefficient storage and updating sub-module. The hierarchical WRR scheduling method specifically comprises the following steps: 1) calculating a weight coefficient of each queue; 2) selecting a round-robin (RR) scheduling scheme; 3) carrying out RR scheduling based on the weight coefficients; and 4) carrying out hierarchical RR scheduling based on the weight coefficients. The device and method has the following advantages: 1) scheduling weights can be adjusted in a real-time manner according to business volumes of various priorities; 2) adaptation to different business distributions and business arrival rates can be achieved, a high service quality can be ensured, and the packet loss probability of businesses with high priorities can be reduced; and 3) the network construction cost can be reduced, and the network performance and the network service quality can be improved.

Description

technical field [0001] The invention relates to a layered weighted round robin scheduling device and method, belonging to the technical field of communication. Background technique [0002] With the increase of new functions and new scenarios of the Internet and the Internet of Things, various network applications are widely emerging. The switching network needs to be able to provide multi-priority business services. The traditional load-balancing Oueued) structure, it is generally believed that the queue can be of infinite length, which is inconsistent with the actual situation. When the input queue is of limited length, packet loss will occur. This problem is more obvious when scheduling multi-priority services. Traditional round-robin Inquiry scheduling is difficult to provide priority distinction, such as RR (Round-Robin) algorithm; if high-priority services are always prioritized, it will make it difficult for low-priority services to obtain services in time, such as ER...

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/869H04L12/865H04L12/863H04L12/861H04L47/6275
CPCH04L47/60H04L47/623H04L47/6245H04L47/6275H04L49/90
Inventor 高雅陈天娥肖颖
Owner WUXI VOCATIONAL & TECHN COLLEGE
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