Comparisons of packet scheduling algorithms for fair service among connections

Author

Matsuo, Takahiro ; Hasegawa, Go ; Murata, Masayuki ; Miyahara, Hideo

Author_Institution

Dept. of Inf. & Math. Sci., Osaka Univ., Japan

fYear

1999

fDate

1999

Firstpage

137

Lastpage

144

Abstract

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

Keywords

Internet; packet switching; performance evaluation; scheduling; transport protocols; DRR; Deficit Round Robin; FIFO; First In First Out; Internet; RED; Random Early Detection; TCP; fair service; fairness; network router; packet scheduling algorithms; performance; simulation; Algorithm design and analysis; Analytical models; Context modeling; Context-aware services; Delay; Protocols; Round robin; Scheduling algorithm; Throughput; Web and internet services;

fLanguage

English

Publisher

ieee

Conference_Titel

Internet Workshop, 1999. IWS 99

Conference_Location

Osaka

Print_ISBN

0-7803-5925-9

Type

conf

DOI

10.1109/IWS.1999.811005

Filename

811005