BSFQ: Bin Sort Fair Queueing

8 years 11 months ago
BSFQ: Bin Sort Fair Queueing
—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 framebased 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-toend delay and fairness guarantees to conformant flows. BSFQ also has a built-in buffer management function that can protect packets of conformant flows from non-conformant traffic. The performance of BSFQ and its ability to detect non-conformant flows are studied using simulations and compared to those of the Deficit Round Robin method.
Shun Yan Cheung, Corneliu S. Pencea
Added 15 Jul 2010
Updated 15 Jul 2010
Type Conference
Year 2002
Authors Shun Yan Cheung, Corneliu S. Pencea
Comments (0)