Method for realizing multilevel queue scheduling in data network and device

A multi-level queue and data network technology, applied in the field of multi-level queue scheduling, to achieve the effect of improving flexible application capabilities

Inactive Publication Date: 2009-10-14
ZTE CORP
View PDF0 Cites 18 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

When the network is congested, the packets in the SP will be forwarded first, and the packets in the WRR will be forwarded in proportion according to the assigned weight; this solves the disadvantages caused by using WRR alone, but it still cannot be well Solve the disadvantages two

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
  • Method for realizing multilevel queue scheduling in data network and device
  • Method for realizing multilevel queue scheduling in data network and device
  • Method for realizing multilevel queue scheduling in data network and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0048] The technical solution of the present invention will be described in further detail below.

[0049] Such as figure 2 As shown, the basic idea of ​​the present invention is: on the basis of existing two-level queue, i.e. SP+WRR, a new one-level queue is added, and the queue is named idle queue for the time being, and the priority of SP, WRR, idle queue is changed from high to high to low. When the network is congested, some packets that do not need to be guaranteed are sent to the idle queue separately. In this way, the forwarding order of the packets is changed from the existing SP→WRR to SP→WRR→idle queue, so that the packets that do not need to be guaranteed Text does not occupy bandwidth.

[0050] Such as image 3 As shown, the method for realizing multi-level queue scheduling in the present invention comprises the following steps:

[0051] Step 301, configure the multi-level queue scheduling technology on the device, that is, configure the queue scheduling mode a...

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 method for realizing multilevel queue scheduling in a data network. The method comprises the following steps of: sending the message into the tail part of a corresponding queue according to the priority of the received message; if the exit direction of the current network is not congested, forwarding the message received currently; otherwise, according to the queue scheduling mode of strict priority queues, weighted fair queues and idle queues which are preset, firstly executing scheduling processing flow of the strict priority queues; then, if the exit direction of the current network also has residual bandwidth, executing scheduling processing flow of the weighted fair queues; and then, if the exit direction of the current network also has residual bandwidth, carrying out forward processing to the messages in the idle queues. The invention also provides a device used for realizing multilevel queue scheduling in the data network. The method can lead the messages without need of guarantee not to preempt the bandwidth, thus improving the flexible application capability of queue scheduling.

Description

technical field [0001] The invention relates to queue scheduling technology, in particular to a method and device for realizing multi-level queue scheduling in a data network. Background technique [0002] The amount of data processed by the current network is increasing, and network congestion is extremely common. Congestion prevents traffic from obtaining resources in a timely manner, which is the source of service performance degradation. When network congestion occurs, it must be managed and controlled. The common method is to use queuing technology, also known as queuing strategy. These queuing strategies are used to deal with the situation that the bandwidth requirement exceeds the total bandwidth that the network can provide. [0003] The key technologies used in the above queuing strategy are generally Strict Priority Queuing (SP, StrictPriority) and Weighted Fair Queuing (WRR, Weighted Round Robin), or a combination of the two. Among them, the SP is to classify 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
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/56H04L12/26H04L12/869
Inventor 沈树华周继华
Owner ZTE CORP
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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap