Flow scheduling method and device
A flow scheduling and flow technology, applied in the computer field, can solve the problems of affecting server performance, reducing streaming server performance, and low flow scheduling efficiency, so as to improve bandwidth allocation efficiency, avoid memory switching and memory locking, and simplify message scheduling process Effect
Active Publication Date: 2021-02-12
HUAWEI CLOUD COMPUTING TECH CO LTD
View PDF6 Cites 0 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
In the existing HTB technology, when a child node queue of the parent node queue borrows tokens from the parent node queue, the parent node queue needs to be locked, so that other child node queues of the parent node queue will not be able to borrow tokens from the parent node queue after locking. The queue borrows bandwidth. Since the parent node queue is set in the server memory, if the memory is locked too many times, the performance of the stream server will be reduced. In addition, the child node queue borrows a token from the parent node queue and uses the token When borrowing bandwidth from the parent node queue, memory switching operations are involved. Too many memory switching operations will also affect the performance of the server
[0004] Therefore, the efficiency of traffic scheduling is not high by adopting the method of the prior art
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 moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0062] According to the constraints of all nodes in the traffic distribution tree structure, this application performs normalization processing through mathematical modeling to obtain the constraints of all leaf nodes, thereby normalizing the multi-level token buckets to the order on the leaf nodes card bucket. For the convenience of description, this application defines the following parameters: the effective demand bandwidth of leaf nodes (Demandrate, D), the available bandwidth of leaf nodes (Supply rate, S), AR and CR, where the effective demand bandwidth is also called For the traffic arrival rate, the entitlement bandwidth is also called the allocated bandwidth. The token bucket can determine a set of size relationships between D and S (D≤S). In the prior art, D of a leaf node appears in multiple inequalities and needs to go through multiple token buckets. This application simplifies constraints, reducing the number of token buckets.
[0063] figure 1 A schematic diag...
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
Login to View More Abstract
The present application provides a traffic scheduling method and device, by obtaining the weight of the first receiving queue according to the classification attribute of the first receiving queue, and obtaining the traffic arrival of the first receiving queue according to the historical packet receiving status and weight of the first receiving queue Rate, obtain the additional bandwidth of the first receiving queue from the total bandwidth of HTB according to the weight, obtain the allocated bandwidth of the first receiving queue according to the traffic arrival rate, guaranteed bandwidth and additional bandwidth of the first receiving queue, and perform speed limit operation according to the allocated bandwidth , that is, in the process of bandwidth allocation, bandwidth allocation can be performed without visiting the parent node. Therefore, no node jump and data maintenance of the parent node are required, thereby improving the efficiency of bandwidth allocation, simplifying the packet scheduling process, and improving the It improves the efficiency of message scheduling and reduces the processing delay of the message.
Description
technical field [0001] The present application relates to the field of computer technology, and in particular to a flow scheduling method and device. Background technique [0002] Network as a Service (NaaS) is the mainstream direction of network technology development at present. Different tenants and applications of cloud networks have different requirements for the Quality of Service (QoS) of network packets. This "multiple The realization of "Model of Level QoS" requires a traffic scheduling method. The traffic scheduling method can set the messages received by the network card into the memory of the server, and store different types of messages in queues in the memory. The queues include enqueue queues and queues. Dequeue the queue. [0003] In the prior art, a hierarchical token bucket (Hierachical Token Bucket, HTB) algorithm is used to implement traffic scheduling of queued packets, which can limit and integrate network traffic of a certain type of packets at a cert...
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
Login to View More Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/873H04L12/819H04L47/52H04L47/21
CPCH04L47/527H04L47/52H04L47/215
Inventor 李荣振徐聪陈帅曹水
Owner HUAWEI CLOUD COMPUTING TECH CO LTD