Rate-based scheduling discipline for packet switching networks

Abstract

A new rate-based scheduling discipline for packet switching networks is presented. The proposed algorithm remedies a drawback of the ‘virtual clock’ scheme, and provides a bandwidth guarantee like the ‘virtual clock’ scheme. The proposed scheme exhibits good properties comparable to the weighted fair queueing scheme even though it is still a simple algorithm.