Queue dispatching method and apparatus in data network

A queue scheduling and data network technology, applied in the field of queue scheduling, can solve the problems of large delay jitter, large burst, and large jitter in packet transmission, and achieve the effects of reduced burst and jitter, uniform data, and uniform transmission opportunities

Inactive Publication Date: 2006-05-17
HUAWEI TECH CO LTD
View PDF0 Cites 17 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, in the late period of the scheduling cycle, there is still a situation where the data of a queue is sent continuously. The final result is that there are instantaneous burst packets in the late stage of the scheduling cycle

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 dispatching method and apparatus in data network
  • Queue dispatching method and apparatus in data network
  • Queue dispatching method and apparatus in data network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0063] The core of the present invention to realize the queue weighted scheduling in the data network is to carry out according to the weight scheduling interval of each queue. The so-called weight scheduling interval means that in a scheduling cycle, each queue is determined according to its weight value and can guarantee the data of the queue. Schedule a value that is as uniform as possible. Queue scheduling based on this value can ensure that the scheduling opportunities of each queue are evenly distributed and the jitter is as small as possible, so that the sending opportunities obtained by each queue are almost uniform, and the delay jitter of data transmission Both will be very small, as detailed below.

[0064] refer to figure 1 , this figure is the main flowchart of the queue scheduling method of the present invention, mainly comprising the following steps:

[0065] In step 10, determine the weights of weighted scheduling of each queue. During specific implementation,...

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

A method for dispatching queue in data network includes confirming weight of weighted dispatch for each queue and confirming relevant weighted dispatch interval in a weighted dispatch cycle according to weight of each queue, relevantly dispatching each queue data to be out of queue for being sent out according to confirmed weighted ¿C dispatch interval of each queue. In addition, a relevant queue dispatching device is also disclosed.

Description

technical field [0001] The invention relates to the technical field of data communication, in particular to a queue scheduling method and device for performing weighted round-robin scheduling on data of multiple queues 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. Congestion may cause the following negative effects: Congestion increases packet transmission delay and delay jitter, and excessive delay will cause packet retransmission; congestion It will reduce the effective throughput of the network and cause damage to network resources; increased congestion will consume a lot of network resources (especially storage resources), and unreasonable resource allocation may even cause the system to fall into resource deadlock and collapse. Wh...

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 HUAWEI TECH CO LTD
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