Document Type

Technical Report

Department

Computer Science and Engineering

Publication Date

2001-01-01

Filename

WUCS-01-22.PDF

Technical Report Number

WUCS-01-22

Abstract

Packets in the Internet can experience large queueing delays during busy periods. Backbone routers are generally engineered to have large buffers, in which packets may wait as long as half a second (assuming FIFO service, longer otherwise). During congestion periods, these bufferfs may stay close to full, subjecting packets to long delays, even when the intrinsic latency of the path is relatively small. This paper studies the performance improvements that can be obtained by using more sophisticated packet schedulers, than are typical of Internet routers. The results show that the large buffers found in WAN routers ocntribute only marginally to improving router throughput, and the higher delays that come with large buffers makes them a dubious investment. The results also show that better packet scheduling algorithms can produce dramatic improvements in fairness. Using ns-2 simulations, we show that algrithms using multiple queues can significantly outperform RED and Blue, especially at smaller buffer sizes. Over a single-bottleneck link, the variance in TCP goodput using the proposed multiqueue packet schedulers is one-tenth that obtained with RED and one-fifth that obtained wiht Blue. Given a traffic mix of TCP flows with different round-trip times, longer round-trip time flows achieve 80% of their fair-share using multiqueue schedulers, compared to 40% under RED and Blue. We observe a similar performance improvement for multi-hop paths.

Comments

Permanent URL: http://dx.doi.org/10.7936/K79Z933P

Download

Share

COinS