BROWSE
Detail
Journal Article
A New Starting Potential Fair Queuing Algorithm with O(1) Virtual Time
- Authors
- Dong Yong Kwak, Nam Seok Ko, Bongtae Kim, Hong Shik Park
- Issue Date
- 2003-12
- Citation
- ETRI Journal, v.25, no.6, pp.475-488
- Language
- English
- Type
- Journal Article
- Abstract
- In this paper, we propose an efficient and simple fair queuing algorithm, called new starting potential fair queuing (NSPFQ), which has O(1) complexity for virtual time computation and also has good delay and fairness properties. NSPFQ introduces a simpler virtual time recalibration method as it follows a rate-proportional property. The NSPFQ algorithm recalibrates the system virtual time to the minimum virtual start time among all possible virtual start times for head-of-line packets in backlogged sessions. Through analysis and simulation, we show that the proposed algorithm has good delay and fairness properties. We also propose a hardware implementation framework for the scheduling algorithm.
- KSP Keywords
- Analysis and simulation, Fair queuing, Hardware implementation, Implementation framework, Queuing algorithm, Scheduling algorithm, Virtual time
This work is distributed under the term of Korea Open Government License (KOGL)
(Type 4: : Type 1 + Commercial Use Prohibition+Change Prohibition)
(Type 4: : Type 1 + Commercial Use Prohibition+Change Prohibition)
