DocumentCode
3243010
Title
Three remedied algorithms for advanced waiting time scheduler
Author
Lai, Yuan-Cheng ; Li, Wei-Hsi
Author_Institution
Dept. of Inf. Manage., Nat. Taiwan Univ. of Sci. & Technol., Taiwan
fYear
2002
fDate
17-20 Dec. 2002
Firstpage
617
Lastpage
622
Abstract
The advanced waiting time priority scheduler (AWTP), modified from the waiting time priority scheduler (WTP), was proposed to achieve proportional delay differentiation. AWTP not only achieves more accurate delay proportion than the WTP scheduler in short or long timescales, but also greatly reduces the overall queuing delay when the traffic load is moderate. In this paper, we find that AWTP cannot steadily keep the delay ratio under different traffic load distributions because its scheduling sometimes ignores considering packet waiting time. Thus, three remedied algorithms, named minus-WTP (MWTP), existing-WTP (EWTP), and counting-WTP (CWTP), are proposed to resolve this problem. All remedies simultaneously consider the packet waiting time and packet transmission time. Simulation results reveal that these modifications inherit the merit of AWTP and actually alleviate this side effect.
Keywords
Internet; processor scheduling; queueing theory; advanced waiting time priority scheduler; delay ratio; packet transmission time; packet waiting time; proportional delay differentiation; queuing delay; simulation; traffic load; waiting time priority scheduler; Delay effects; Diffserv networks; Harmonic analysis; IP networks; Information management; Protocols; Quality of service; Scheduling algorithm; Telecommunication traffic; Video on demand;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Systems, 2002. Proceedings. Ninth International Conference on
ISSN
1521-9097
Print_ISBN
0-7695-1760-9
Type
conf
DOI
10.1109/ICPADS.2002.1183474
Filename
1183474
Link To Document