Analysis of the Shortest Queue First service discipline with two classes

Fabrice M. Guillemin, Alain D. Simonian · 2014

To address the problem of buffer bloat causing latency for time sensitive flows in the Internet, we introduce the Shortest Queue First (SQF) algorithm. This service discipline consists of serving the flow with the least number of backlogged bytes in a buffer. Considering a system with two flows and

Read the paper · More papers on PaperTik