In search of a fair scheduling policy for serving multi-queue systems

A weighted round robin scheduling (WRRS) scheme was proposed in Katevenis et al. (1991) to serve a system of two queues by a single server. The weights-which determine the time duration for which a non-empty queue is served-are determined on the basis of monitoring the traffic mix and characteristics at the entry point of the node. The paper proposes incorporation (optional) of one more factor in the process of determination of the weights. This being the setting up of an adaptive threshold in each of the buffers in order to determine the number of cells/packets which are served during every visit (by the server) to each of the queues. The technique can be easily extended to multi-queue systems