Credit-based fair queueing (CBFQ)
K.T. Chan, Brahim Bensaou, Danny H. K. Tsang · Electronics Letters · 1997
A simple rate-based scheduling algorithm for packet-switched networks (e.g. Internet) is proposed. By using simple counters to keep track of the credits accumulated by each traffic stream, the algorithm decides which stream to serve next, based on the bandwidth share allocated to each traffic stream, and the sizes of the head of line (HOL) packets of the different streams. Our proposed CBFQ algorithm achieves the same fairness and delay bounds as the alternative approaches based on virtual time, while avoiding the implementation problems inherent in these methods.