TY - GEN
T1 - Comparisons of packet scheduling algorithms for fair service among connections
AU - Matsuo, Takahiro
AU - Hasegawa, Go
AU - Murata, Masayuki
AU - Miyahara, Hideo
PY - 1999/1/1
Y1 - 1999/1/1
N2 - We investigate the performance of TCP under several packet scheduling algorithms at the router. Our main focus is how fair service can be provided for elastic applications sharing the link capacity. For this purpose, we consider the following three packet scheduling algorithms; FIFO (First In First Out), RED (Random Early Detection), and DRR (Deficit Round Robin). Through simulation and analysis results, we discuss the degree of achieved fairness in those scheduling algorithms. Furthermore, we propose a new algorithm which combines the RED and DRR algorithm in order to prevent an unfairness property of the original DRR algorithm.
AB - We investigate the performance of TCP under several packet scheduling algorithms at the router. Our main focus is how fair service can be provided for elastic applications sharing the link capacity. For this purpose, we consider the following three packet scheduling algorithms; FIFO (First In First Out), RED (Random Early Detection), and DRR (Deficit Round Robin). Through simulation and analysis results, we discuss the degree of achieved fairness in those scheduling algorithms. Furthermore, we propose a new algorithm which combines the RED and DRR algorithm in order to prevent an unfairness property of the original DRR algorithm.
UR - http://www.scopus.com/inward/record.url?scp=0347147282&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0347147282&partnerID=8YFLogxK
U2 - 10.1109/IWS.1999.811005
DO - 10.1109/IWS.1999.811005
M3 - Conference contribution
AN - SCOPUS:0347147282
T3 - 1999 Internet Workshop, IWS 1999
SP - 137
EP - 144
BT - 1999 Internet Workshop, IWS 1999
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1999 Internet Workshop, IWS 1999
Y2 - 18 February 1999 through 20 February 1999
ER -