Comparisons of packet scheduling algorithms for fair service among connections

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