TCP - IP White Papers
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet
Overview This paper investigates the performance of TCP under three representatives of packet scheduling algorithms at the router. The main focus is to investigate how fair service can be provided for elastic applications sharing the link. Packet scheduling algorithms that the paper considers are FIFO (First In First Out), RED (Random Early Detection), and DRR (Deficit Round Robin). Through simulation and analysis results, the paper discusses the degree of achieved fairness in those scheduling algorithms. Furthermore, it proposes a new algorithm which combines RED and DRR algorithms in order to prevent the unfairness property of the original DRR algorithm, which appears in some circumstances where one wants to resolve the scalability problem of the DRR algorithm.
| Publisher | Osaka University | File Format | |
|---|---|---|---|
| Date Published | February 2001 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful?
White Paper RSS
Download
