Credit-based fair scheduling for input-queued switches
A. Gourgy, Honglin Wu, Ted H. Szymanski · 2004
We present a novel scheduling algorithm for Internet routers with input-queued switches based on credit-based fair queueing. We present a flow-based iterative credit-based fair scheduler (iCBFS) for crossbar switches, that provides fair bandwidth distribution among flows at a fine granularity and achieves asymptotically 100% throughput, under uniform traffic. To reduce the implementation complexity of iCBFS, we present a port-based version of iCBFS that is tailored towards high-speed hardware implementation.