A proposal of a new packet scheduling algorithm which can reduce the delay of small packets

Abstract

Eligibility Based Round Robin (EBRR) scheduler proposed by Lenzini et al. is a packet scheduling algorithm which can be considered as an extension of Surplus Round Robin (SRR), computational complexity of which is O(1) even when quantum size is less than the maximum packet size. In this paper, we propose an extension of EBRR which makes it possible to transmit packets smaller than a threshold prior to packets larger than the threshold among packets received in one scheduling round. It can be used in Home Gateway. The computational complexity of the proposed algorithm is O(1).