Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Queue scheduling method and device

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

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 prior art when scheduling packets of different lengths to be sent in different queues. The problem of increased overall delay in sending packets

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
  • Queue scheduling method and device
  • Queue scheduling method and device
  • Queue scheduling method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0054] In Embodiment 1, the queue scheduling method provided by the embodiment of the present invention adopts the first method in the above-mentioned step S104: the scheduling processing of the updated current packet to be sent entering the active queue, that is, after sending the currently scheduled packet After the current packets to be sent in the queue, if the queue is still an active queue, continue to process the updated current packets 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 current active queues is (5+2+5) / 3=4, the currently scheduled active queue is L1, and the length of the current packet to be sent is 5. Each queue initial state as Figure 3a Shown:

[0056] Since the current length of the packet to be sent is 5 greater than the average length 4, it enters the scheduling process for L2; the current length of the packet to be sent in L2 is 2, and since 2 is smaller than the ave...

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 process of the current packet to be sent entering the next active queue, that is, after sending the currently scheduled queue After the current packet to be sent, process the current packet to be sent in the next active queue.

[0069]At the beginning of a poll, the average length of the current packets to be sent in all current active queues is (5+2+5) / 3=4, the currently scheduled active queue is L1, and the length of the current packet to be sent is 5. Each queue initial state as Figure 3a Shown:

[0070] Since the current length of the packet to be sent is 5 greater than the average length 4, it enters the scheduling process for L2; the current length of the packet to be sent in L2 is 2, and since 2 is smaller than the average length 4, the packet is sent, using the current maximum allowable sendin...

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 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
no application Login to View More
IPC IPC(8): H04L12/863
Inventor 顾蔚
Owner CHINA MOBILE GROUP SHAIHAI
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com