Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A queue scheduling and queue technology, applied in the field of queue scheduling methods and devices, can solve the problem of increasing the overall delay of packets to be sent
Active Publication Date: 2014-06-18
CHINA MOBILE GROUP SHAIHAI
View PDF5 Cites 7 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0006] The embodiment of the present invention provides a queue scheduling method and device, which is used to solve the problem in the prio
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
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Example Embodiment
[0053] Example 1:
[0054] In the first embodiment, the queue scheduling method provided by the embodiment of the present invention adopts the first method in the above step S104: the scheduling processing of the updated currently scheduled packets entering the active queue, that is, after the currently scheduled packets are sent After the current packet to be sent in the queue, if the queue is still an active queue, continue to process the updated current packet to be sent in the active queue.
[0055] At the beginning of a poll, the average length of the current packets to be sent in all active queues is (5+2+5) / 3=4, the currently scheduled active queue is L1, the current packet length to be sent is 5, and each queue The initial state is as Figure 3a shown:
[0056] Since the current packet length 5 to be sent is greater than the average length 4, the L2 scheduling process is entered; the current length of the L2 packet to be sent is 2, since 2 is less than the average le...
Example Embodiment
[0067] Embodiment 2:
[0068] In the second embodiment, the queue scheduling method provided by the embodiment of the present invention adopts the second method in the above step S104: the scheduling processing of the currently to-be-sent packets entering the next active queue, that is, after sending the currently scheduled queue After the current to-be-sent packet is processed, the current to-be-sent packet of the next active queue is processed.
[0069]At the beginning of a poll, the average length of the current packets to be sent in all active queues is (5+2+5) / 3=4, the currently scheduled active queue is L1, the current packet length to be sent is 5, and each queue The initial state is as Figure 3a shown:
[0070] Since the current packet length 5 to be sent is greater than the average length 4, the L2 scheduling process is entered; the current length of the L2 packet to be sent is 2, since 2 is less than the average length 4, the packet is sent, using the current maxi...
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 embodiment of the invention provides a queue scheduling method and a device. In a queue scheduling polling, according to the current to-be sent grouping of the current scheduling active queue, the current to-be sent grouping is sent when the length of the current to-be sent grouping of the active queue is no longer than the average length of the current to-be sent groupings of the current all active queues; the difference value between the current maximal allowable sending quantity of the active queue and the length of the sent grouping is used for updating the current maximal allowable sending quantity corresponding to the active queue, and scheduling processing of other to-be sent groupings is carried out; when the length of the current to-be sent grouping of the active queue is larger than the average length of the current to-be sent groupings of the current all active queues, scheduling processing of the current to-be sent groupings of the next active queue is carried out; when no active queue exists, each corresponding maximal allowable sending quantity of each queue is updated, and scheduling processing of next polling is carried out. The invention relates to the field of network communication.
Description
technical field [0001] The invention relates to the field of network communication, in particular to a queue scheduling method and device. Background technique [0002] The traditional dynamic weighted round robin (DWRR, Dynamic Weighted Round Robin) queue scheduling method is a polling queue scheduling method based on queue weights. This queue scheduling method sets a deficit meter (DC, Deficit Counter) and weight (Weight) for each queue. The DC value indicates the maximum allowable sending amount that can be scheduled from the queue each time, and Weight indicates a single poll. The send volume allocated to the queue in . At the beginning of scheduling, the DC value of each queue is greater than or equal to Weight. [0003] In each queue scheduling round-robin, when scheduling each non-empty queue, first judge whether the current length of the current packet to be sent (that is, the data volume of the packet to be sent) of the currently scheduled queue is greater than th...
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
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to view more 
Login to view more