Unlock instant, AI-driven research and patent intelligence for your innovation.

Weighted fair queue dispatching method and device based on category

A weighted fairness and queue scheduling technology, applied in the field of data transmission, can solve problems such as frequent polling operations and system performance degradation

Inactive Publication Date: 2012-01-25
BEIJING XINWANG RUIJIE NETWORK TECH CO LTD
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] Embodiments of the present invention provide a class-based weighted fair queue scheduling method and device, which are used to solve the problem of frequent polling operations in the class-based weighted fair queue scheduling process in the prior art, resulting in system performance degradation

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
  • Weighted fair queue dispatching method and device based on category
  • Weighted fair queue dispatching method and device based on category
  • Weighted fair queue dispatching method and device based on category

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0032] In the class-based weighted fair queue scheduling method provided by Embodiment 1 of the present invention, its flow is as follows figure 2 As shown, the execution steps are as follows:

[0033] Step S101: Classify the received message.

[0034] After receiving the message sent by other network devices, it first classifies the message according to the rules defined by the user, determines the classification number of the message, and performs classification identification.

[0035] Among them, the packets that meet the user-defined classification rules are classified into the corresponding categories according to the user-defined classification rules, and the packets that do not meet the user-defined classification rules are classified into the corresponding categories according to the default classification rules of the weighted fair queue, and sent to the receiving Add classification identifiers to received packets.

[0036] Step S102: Allocate a class token repres...

Embodiment 2

[0056] The class-based weighted fair queue scheduling method provided by Embodiment 2 of the present invention is described by taking two message sending queues as an example. The implementation process is as follows image 3 As shown, the execution steps are as follows:

[0057] Step S201: Classify the received packets.

[0058] The specific division method is the same as step S101.

[0059] For example: a message received by a network device may contain N categories.

[0060] Step S202: Allocate a grade token representing the sending grade of the message to the classified received message.

[0061] The specific allocation process is the same as step S102.

[0062] The distribution structure of classification tokens can be as follows Figure 4 shown. The total number of tokens that can be allocated is determined according to the interface bandwidth, that is, according to the capacity of the interface token bucket. Then assign tokens to each message category to obtain th...

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 discloses a weighted fair queue dispatching method and a device based on a category. The method comprises the following steps of: distributing a grade token representing the message sending grade for a message according to the message buffering capacity of the message category to which the received message belongs and the capacity representing a category token bucket that the message category allows to use bandwidth; determining the use condition of interface bandwidth in a current dispatching period according to the sending flow rate of the message passing through the interfaceand an interface token bucket representing the total bandwidth of the interface; determining the allowed sending grade corresponding to the use condition of the interface bandwidth in the current dispatching period according to the corresponding relation of the preset use condition of the interface bandwidth and the allowed sending grade; and buffering the message carrying the grade token of the allowed sending grade to a message sending queue. The method controls the sending of the message through the category token bucket and the interface token bucket, thereby the number of the message buffering queues is reduced, the queue polling of the message dispatching is decreased, the system resource is saved and the system performance is improved.

Description

technical field [0001] The invention relates to the technical field of data transmission, in particular to a class-based weighted fair queue scheduling method and device. Background technique [0002] Class-based Weighted Fair Queuing (Class-based Weighted Fair Queuing, CBWFQ) is a quality of service (QoS) queuing mechanism, CBWFQ adds user-defined queues, which is a standard function of Weighted Fair Queuing (WFQ) The expansion of CBWFQ also includes Low Latency Queue (Low Latency Queue, LLQ), which can ensure that the network bandwidth is allocated fairly among various network data flows according to the set rules according to the user definition. [0003] In the prior art, class-based weighted fair queue scheduling is to put packets of different classifications into different queues according to packet classification rules, perform operations related to queue bandwidth limitation when the packets leave the device interface, and output team message. Such as figure 1 Sho...

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
Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/56H04L47/629
Inventor 熊途
Owner BEIJING XINWANG RUIJIE NETWORK TECH CO LTD