Open AccessA Modified Dynamic Weighted Round Robin Cell Scheduling Algorithm
Author(s) -
Kwak JiYoung,
Nam JiSeung,
Kim DooHyun
Publication year - 2002
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.02.0102.0504
Subject(s) - computer science , scheduling (production processes) , dynamic priority scheduling , round robin scheduling , real time computing , algorithm , weighted round robin , earliest deadline first scheduling , transmission delay , fair share scheduling , rate monotonic scheduling , transmission (telecommunications) , mathematical optimization , computer network , mathematics , quality of service , telecommunications
In this paper, we propose the modified dynamic weighted round robin (MDWRR) cell scheduling algorithm, which guarantees the delay property of real‐time traffic and also efficiently transmits non‐real‐time traffic. The proposed scheduling algorithm is a variation of the dynamic weighted round robin (DWRR) algorithm and guarantees the delay property of real‐time traffic by adding a cell transmission procedure based on delay priority. It also uses a threshold to prevent the cell loss of non‐real‐time traffic that is due to the cell transmission procedure based on delay priority. Though the MDWRR scheduling algorithm may be more complex than the conventional DWRR scheme, considering delay priority minimizes cell delay and decreases the required size of the temporary buffer. The results of our performance study show that the proposed scheduling algorithm has better performance than the conventional DWRR scheme because of the delay guarantee of real‐time traffic.