Hierarchical weighted round-robin (WRR) scheduling device and method
A weighted polling and scheduling device technology, applied in the field of communication, can solve the problems of limiting network service quality, network performance, increasing network construction costs, and low link utilization, so as to improve network performance and network service quality, and reduce network traffic. Construction cost, the effect of avoiding network congestion
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Example Embodiment
[0070] Example 1
[0071] Reference attached figure 2 , Hierarchical weighted round-robin scheduling method, its implementation steps are as follows:
[0072] Step 1. Assign weight coefficients to each queue DC i :
[0073] 1a) Let's share P Priority, then each priority corresponds to a queue, a total of P Sub-queues
[0074] 1b) Let a scheduling period be N Time slots or packets with priority i The queue is Q i At every N Time slot counts the number of packets backlogged in the queue as N i ;
[0075] 1c) Calculation P The total number of backlog packets in each sub-queue is N all , which is ;
[0076] 1d) Calculate the weight coefficient of each priority w i , ;
[0077] 1e) Store the weight coefficient of each priority in the weight coefficient storage module, and the weight coefficient storage module is for each priority queue Q i Maintain a weight coefficient counter DC i , At the beginning of each scheduling period DC i = w i .
[0078] Step 2: Determine the scheduling mode th...
Example Embodiment
[0102] Example 2
[0103] Reference attached image 3 In this embodiment, the system provides a total of 4 priority levels. A FIFO queue is maintained for each priority service. The scheduling period is N = 8, priority 0 is the highest, priority 1 is the second, and so on; in this embodiment, the number of backlog packets in the 0th priority queue is 4, the number of backlog packets in the first priority queue is 8, and the second The number of backlog packets in the priority queue is 2, and the number of backlog packets in the third priority queue is 2. The specific steps are as follows:
[0104] Step 1. Assign weight coefficients to each queue DC i :
[0105] The number of backlog packets in each priority queue is obtained through statistics, and the weight coefficients of each priority service are obtained according to the weight coefficient calculation method as follows: w 0 = 2, w 1 = 4 ,w 2 = 1, w 3 = 1; the obtained weight coefficient is assigned to the weight coefficien...
Example Embodiment
[0124] Example 3
[0125] Reference attached Figure 4 In this embodiment, the system provides a total of 4 priority levels. A FIFO queue is maintained for each priority service. Priority 0 is the highest, priority 1 is the second, and so on; scheduling cycle N = 8, in this embodiment, the number of backlog packets in the 0th priority queue is 2, the number of backlog packets in the first priority queue is 6, the number of backlog packets in the second priority queue is 6, and the number of backlog packets in the third priority queue The number of backlog groups is 2. The specific steps are as follows:
[0126] Step 1. Assign weight coefficients to each queue DC i :
[0127] The number of backlog packets in each priority queue is obtained through statistics, and the weight coefficients of each priority service are obtained according to the weight coefficient calculation method as follows: w 0 = 1, w 1 = 3 ,w 2 = 3, w 3 = 1; the obtained weight coefficient is assigned to the wei...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.
© 2023 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap