Virtual minimum potential queuing
- Authors
- Lee, Chul Ki; Jeong, Deog Kyoon; Shim, Yong Chul
- Issue Date
- 2007
- Publisher
- IOS PRESS
- Keywords
- fair queuing; virtual time update; O(1) complexity
- Citation
- JOURNAL OF HIGH SPEED NETWORKS, v.16, no.4, pp.323 - 339
- Journal Title
- JOURNAL OF HIGH SPEED NETWORKS
- Volume
- 16
- Number
- 4
- Start Page
- 323
- End Page
- 339
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/24315
- ISSN
- 0926-6801
- Abstract
- We propose Virtual Minimum Potential Queuing (VMPQ) which provides a simple virtual time update function with O(1) complexity. While Weighted Fair Queuing (WFQ) provides low latency and good fairness, the virtual time update function has O(V) complexity for serving V busy flows. Start Potential Fair Queuing (SPFQ), which updates virtual time with a reduced complexity of O(log V), provides a fairness index very close to WFQ. Some other algorithms reduce virtual time update complexity further, but they degrade the fairness index significantly. VMPQ recalibrates virtual time using a virtual minimum potential, which is calculated with only a pre- computed constant and the finish time of the packet selected for transmission. This method requires O(1) complexity for the recalibration. Additionally, it does not affect the maximum latency and keeps fairness index to be almost identical to SPFQ.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Computer Engineering > Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/24315)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.