Virtual dynamic priority packet dispatching method
A dynamic priority, packet scheduling technology, applied in network traffic/resource management, digital transmission systems, electrical components, etc., can solve problems such as unfair packet scheduling algorithms
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment approach
[0078] Step 1 Initialize the priority queue and scheduler, such as image 3 shown. Substeps include:
[0079] 1) Create three priority queues respectively, and their corresponding priorities are 0, 0.5, and 1 respectively, and the smaller the number, the higher the priority.
[0080] 2)F t (p) initialization. According to scheme 2, the F corresponding to the initial time t=0 0 (p) initialized to F 0 (0)=0,F 0 (1)=1,F 0 (2)=2, the initial mapping F 0 (p) is initialized to the identity map.
[0081] 3) Initialize the scheduler scheduling algorithm. The scheduling algorithm adopts the scheduling algorithm of the PQ algorithm, that is, the queue with the highest priority is first selected for scheduling, and when the queue with the highest priority is empty, the queue with the second highest priority is selected, and if the queue with the second highest priority is empty , select a lower priority queue, and so on.
[0082] 4) The initial threshold r, where r is the time...
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, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com