DocumentCode :
111354
Title :
Rotating Preference Queues: An Efficient Queue Management Scheme for Fair Bandwidth Allocation
Author :
Jui-Pin Yang
Author_Institution :
Dept. of Inf. Technol. & Commun., Shih Chien Univ., Taipei, Taiwan
Volume :
17
Issue :
2
fYear :
2013
fDate :
Feb-13
Firstpage :
420
Lastpage :
423
Abstract :
In this study, an efficient queue management scheme is proposed to achieve fair bandwidth sharing by rotating preference queues (RPQ). RPQ consists of a set of first-in-first-out (FIFO) output queues that are dynamically rotated. In addition, RPQ selects accepted packets and dispatches them to adequate output queues depending on packet distribution and preference. Using simulations, we show that RPQ tends to approach DRR, and it significantly outperforms CSFQ, DDE, CHOKe and FIFO in terms of fairness. RPQ has a complexity of O(1) and is simple to implement in high-speed networks.
Keywords :
bandwidth allocation; queueing theory; telecommunication network management; CHOKe; CSFQ; DDE; DRR approach; FIFO; RPQ; fair bandwidth sharing allocation; first-in-first-out output queues; high-speed network; packet distribution; rotating preference queues management scheme; Bandwidth; Channel allocation; Complexity theory; Indexes; Inductors; Scheduling; Scheduling algorithms; Queue management; bandwidth allocation; fairness;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOMM.2012.121912.121840
Filename :
6400341
Link To Document :
بازگشت