Check patentability & draft patents in minutes with Patsnap Eureka AI!

A fixed-length packet weighted fair queuing scheduling method and device

A technology of weighted fair queuing and scheduling method, which is applied in the field of queue scheduling, and can solve the problem of too many iterations of the counter accumulation algorithm

Active Publication Date: 2018-05-18
SANECHIPS TECH CO LTD
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0049] The technical problem to be solved by the present invention is to provide a fixed-length packet weighted fair queuing scheduling method and device to overcome the problem of too many iterations of the counter accumulation algorithm

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
  • A fixed-length packet weighted fair queuing scheduling method and device
  • A fixed-length packet weighted fair queuing scheduling method and device
  • A fixed-length packet weighted fair queuing scheduling method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0087] Such as Figure 7 As shown, the fixed-length packet weighted fair queuing scheduling method in this solution includes: after completing the task scheduling of the scheduling linked list at the current counting moment of the counter, calculating the distance in the direction greater than the current count value in each non-empty scheduling linked list For the latest count value to be scheduled at the current counting time, the calculated count value to be scheduled is the closest to the current count value as the next count value.

[0088] Wherein, the method for calculating the count value to be scheduled in each non-empty temperature linked list that is closest to the current count time in the direction greater than the current count value specifically includes: determining the X lowest standard count values ​​corresponding to the non-empty temperature linked list The valid bit is called BV, and the X low significant bits that determine the current count value are call...

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 fixed-length packet weighted fair queuing scheduling method and device. In the method, after the task scheduling of the scheduling linked list is completed at the current counting time of the counter, the tasks in each non-empty scheduling linked list that are greater than the current counting time are calculated respectively. For the count value to be scheduled closest to the current count value in the direction, the one closest to the current count value among the calculated count values ​​to be scheduled is taken as the next count value. This solution uses a minimum gap algorithm to replace the counter accumulation algorithm in the original patent, overcomes the problem of too many iterations of the counter accumulation algorithm, and makes the counter accumulation algorithm adapt to high-speed scheduling requirements.

Description

technical field [0001] The present invention relates to a queue scheduling technology for data communication chips, in particular to a weighted fair queuing (Weighted Fair Queuing, WFQ for short) scheduling method and device for fixed-length packets. Background technique [0002] Data communication chips inevitably involve traffic management, and the core of traffic management is queue scheduling technology. WFQ scheduling technology is one of the best performance among various scheduling algorithms such as RR, WRR, and DWRR, and it is also an ideal scheduling algorithm, but the implementation complexity is high, and it is difficult to achieve high performance. [0003] While the bandwidth of data communication chips is gradually increasing, the scheduling method is gradually developing towards authorized scheduling based on representing a fixed number of bytes. The authorized scheduling method is basically similar to the fixed-length packet scheduling method. The WFQ sched...

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 Patents(China)
IPC IPC(8): H04L12/861
Inventor 黄炜孙明施
Owner SANECHIPS TECH CO LTD
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

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