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

Dynamic queue scheduling device and method based on bandwidth borrowing

A bandwidth and queuing technology, applied in digital transmission systems, electrical components, transmission systems, etc., can solve the problems of complex implementation and inapplicability of high-speed networks, and achieve the effects of improving utilization, reducing overall packet loss rate, and reducing waste

Active Publication Date: 2017-03-22
XIDIAN UNIV
View PDF5 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This method has the best fairness, but it needs to calculate and sort the virtual completion time of each packet, so the implementation is more complicated and not suitable for high-speed networks

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
  • Dynamic queue scheduling device and method based on bandwidth borrowing
  • Dynamic queue scheduling device and method based on bandwidth borrowing
  • Dynamic queue scheduling device and method based on bandwidth borrowing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0070] refer to image 3 , the present invention will be further described by a specific example. In this example, there are 3 types of priorities provided by the system, each priority has a queue, and the weight of the first queue is w 1,1 =4, the weight of the second queue is w 2,1 = 2, the weight of the third queue is w 3,1 =1, the total bandwidth of the system is B=100Mbps, and the scheduling period is T=1ms.

[0071] Step 1, assign bandwidth quota to each queue;

[0072] According to the weight of the queue, the CPU proportionally allocates the bandwidth quota to the queue, and obtains the bandwidth quota of the first queue as B 1,1 =56Mbps, bandwidth quota B of the second queue 2,1 = 30Mbps, bandwidth quota B of the third queue 3,1 =14Mbps. The bandwidth quota storage module maintains a counter for each queue and calculates the initial value of the counter to obtain the counter value of the first queue as DC 1,1 =56kb, the counter value of the second queue is DC ...

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 dynamic queue scheduling device and method based on bandwidth borrowing and mainly solves a problem of low bandwidth utilization rate of an output port in the prior art. An implementation scheme of the invention comprises the following steps of reading a register with a configurable CPU through a CPU interface module (1) to obtain a bandwidth quota which is distributed to each queue; storing a bandwidth quota which is distributed to each first input first output queue through a bandwidth quota storage module (2); buffering a data packet at which each business flow arrives through a first input first output buffer queue module (3); scheduling the queue in a weighted round-robin manner through a scheduler module (4) according to the bandwidth quota which is distributed to each queue; and distributing the unused idle bandwidth quota in one scheduling period to a non-empty queue whose data packet is still not output in the scheduling period by a bandwidth borrowing module (5). According to the device and the method, the packet loss probability of a system is reduced, the utilization rate of the bandwidth resources is improved, and the device and the method can be used for routers and switches in a communication network.

Description

technical field [0001] The invention belongs to the technical field of communication, and further relates to a queue scheduling, which can be used in routers and switches. Background technique [0002] Queue scheduling technology is widely used in routers and switches. It schedules and serves different input service flows of switching nodes according to certain service rules, so that all input service flows can share the output link bandwidth of switching nodes in a predetermined way. , is a key technology to ensure network QoS and improve network performance. [0003] The existing queue scheduling methods mainly include strict priority scheduling SP, round robin scheduling RR, weighted round robin scheduling WRR, weighted fair scheduling WFQ and the like. in: [0004] The SP scheduling method schedules the queues strictly according to the priority. Only when the high-priority has no grouping, the low-priority queue will be served, which will make the low-priority queue no...

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/873H04L47/52
CPCH04L47/522
Inventor 潘伟涛郑凌邱智亮梅益波高峥赵海峰刁卓王伟娜高丽丽张汶汶
Owner XIDIAN UNIV
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