Differentiated service-based queue scheduling method

A technology for queue scheduling and differentiated services, applied in digital transmission systems, electrical components, transmission systems, etc., can solve problems such as little consideration and unreasonable balance between algorithm weights and delays

Inactive Publication Date: 2011-02-02
NANJING UNIV OF POSTS & TELECOMM
View PDF2 Cites 44 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] At present, scholars have proposed many queue scheduling algorithms that can provide QoS guarantees, such as First In First Out (FIFO), Priority Queuing (PQ), Custom Queuing (CQ), Weighted Fair Queuing (WFQ), Class Ba

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
  • Differentiated service-based queue scheduling method
  • Differentiated service-based queue scheduling method
  • Differentiated service-based queue scheduling method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0025] WRR and DWRR are based on polling algorithms. In the WRR algorithm, the queues are divided into different service categories. The flows of different service categories enter different queues, and each queue is polled for service according to certain criteria. The WRR scheduling mechanism serves each queue in turn, allowing allocation A queue with a high percentage of bandwidth can schedule multiple packets in one service. Therefore, WRR can ensure that low-priority services can always get rated service resources. However, due to the shortcomings of the polling algorithm, when the packet sizes are not the same, WRR will Queues with smaller packets bring unfairness. In order to overcome the unfairness caused by the variable length of packets, the weight assigned to each queue by the DWRR algorithm is not based on the number of packets, but on the number of bits. In the DWRR algorithm, a difference counter DC (allowed each time The total number of bytes that the scheduler ...

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 differentiated service-based queue scheduling method Deficit Weighed Round Robin plus (DWRR+). In the method, the maximum byte count of a sent packet in once service is dynamically set according to the length of a packet in the current queue, so that the delay characteristic of a low-weight service is ensured, the relative fairness of bandwidth allocation is ensured, the defect that a low-priority queue may not be serviced for a long time is overcome, and the fact that a Deficit Weighed Round Robin plus (DWRR) algorithm cannot better met the requirement on the delay characteristic of the service is improved; a priority queue is set, and a token bucket algorithm is taken as a flow regulator, so that the priority of a real-time service is ensured; and the DWRR+ algorithm and a priority scheduling algorithm PQ are combined to serve as the scheduling strategy of a network node scheduler, so that on the premise of ensuring the priority of the real-time service and output bandwidths of other services, the time delay is reduced, and the service quality of different services can be ensured to a certain extent.

Description

technical field [0001] The invention relates to a queue scheduling method for differentiated services, and mainly studies how to realize the delay characteristics of low-weight services in a QoS-guaranteed network through technical means, and ensure the relative fairness of bandwidth allocation, avoiding the possibility of low-priority queues The disadvantage of not getting service for a long time. In general, delay and weight are contradictory parameters, how to make a balance, how to make a more reasonable choice in the network and ensure fairness is particularly important. The research result obtained by the invention is suitable for QoS network, and has important value for improving the service quality assurance of the network. Background technique [0002] Network QoS (Quality of Service) is to ensure the service requirements of different services through certain policies and mechanisms under the premise of a certain network bandwidth. Specifically, it can be quantifie...

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/56H04L12/743
Inventor 张顺颐谈玲宁向延周井泉伍金富
Owner NANJING UNIV OF POSTS & TELECOMM
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