A Practical Fair Queuing Scheduler: Simplification Through Quantization

The design of fair packet schedulers involves a tradeoff between implementation complexity, on one hand, and delay and fairness guarantees, on the other. In this paper, the authors present Tiered-Service Fair Queuing (TSFQ), a new scheduler that exploits certain properties of Internet traffic to speed up the bottleneck operations related to virtual time computation and packet sorting. Specifically, TSFQ makes innovative use of quantization (along the two dimensions of flow weights and packet lengths) her with specialized yet simple queuing structures.

Provided by: Reed Elsevier Topic: Networking Date Added: Apr 2011 Format: PDF

Find By Topic