BSFQ: bin sort fair queueing
S.Y. Cheung, C.S. Pencea · 2003
Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellent approximation for weighted fair queueing (WFQ) while frame-based methods are more computationally efficient. We present a new packet scheduling algorithm called bin sort fair queueing (BSFQ) that combines the strengths of both type of schedulers. As a result, BSFQ is highly scalable and can provide very good approximation for WFQ. We prove that BSFQ can provide end-to-end delay and fairness guarantees to conformant flows. BSFQ also has a built-in buffer management function that can protect packets of conformant flows from nonconformant traffic. The performance of BSFQ and its ability to detect nonconformant flows are studied using simulations and compared to those of the deficit round robin method.