Title :
A proposal of a new packet scheduling algorithm which can reduce the delay of small packets
Author :
Matsuda, Tetsushi ; Horiuchi, Eiichi ; Yokotani, Tetsuya
Author_Institution :
Inf. Technol. R&D Center, Mitsubishi Electr. Corp., Kamakura, Japan
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).
Keywords :
Internet telephony; computational complexity; internetworking; scheduling; EBRR scheduler; SRR; VoIP; computational complexity; eligibility-based round robin scheduler; home gateway; packet delay reduction; packet scheduling algorithm; packet size; quantum size; surplus round robin; Computational complexity; Delay; Proposals; Round robin; Scheduling; DRR; EBRR; SRR; scheduling algorithm;
Conference_Titel :
Consumer Electronics (GCCE), 2012 IEEE 1st Global Conference on
Conference_Location :
Tokyo
Print_ISBN :
978-1-4673-1500-5
DOI :
10.1109/GCCE.2012.6379596
