TCP performance under aggregate fair queueing
Wei Sun, Kang Geun Shin · 2005
In this paper, we studied TCP performance under aggregate fair queueing (FQ). We first showed the livelock problem of FQ under the DropFront scheme, and proposed a simple solution to the problem. Then, to improve the fairness of aggregate FQ, we proposed a new active buffer-management scheme called ALQD+ (approximated longest queue drop), which is fairer than ALQD. Based on these two enhancements, via simulation, we showed that aggregate FQ provides not only excellent scalability (small scheduling and state-maintenance overheads) but also good performance, especially throughput. In addition to the simulation-based evaluation, we provided a simple performance analysis.