BROWSE
Detail
Conference Paper
Mean starting potential fair queuing for high-speed packet networks
Cited - time in 
Share 
Share
- Authors
- Dong-Yong Kwak, Nam-Seok Ko, Hong-Shik Park
- Issue Date
- 2003-12
- Citation
- GLOBECOM 2003, pp.2870-2874
- Language
- English
- Type
- Conference Paper
- Abstract
- This paper proposes an efficient fair queuing algorithm, called mean starting potential fair queuing (MSPFQ), which has O(l) complexity for the virtual time computation while it has delay and fairness properties similar to starting-potential fair queueing (SPFQ). The key idea of MSPFQ algorithm is that it recalibrates the system virtual time to the mean value of the minimum possible virtual start times of HOL packets in each backlogged session. Through analysis and simulation, this paper shows that the proposed algorithm has good delay and fairness properties.
- KSP Keywords
- Analysis and simulation, High Speed, Packet network, Queuing algorithm, Virtual time, fair queueing, fair queuing, mean value