DocumentCode :
3636866
Title :
Performance of Round Robin-Based Queue Scheduling Algorithms
Author :
Tomáš Balogh;Denisa Luknárová;Martin Medvecký
Author_Institution :
Dept. of Telecommun., Slovak Univ. of Technol. in Bratislava, Bratislava, Slovakia
fYear :
2010
Firstpage :
156
Lastpage :
161
Abstract :
This paper presents the simulation results of comparison of three Round Robin (RR) based QSD (Queue scheduling algorithms). For the first time we propose the comparison of WRR (Weighted Round Robin), WRR/SB (Weighted Round Robin with Save and Borrow) and WRRPQ (Weighted Round Robin with Priority queuing) from the point of view of delay, throughput, packet loss and the possibility of their usage in modern convergence telecommunications networks.
Keywords :
"Scheduling algorithm","Round robin","Quality of service","Queueing analysis","Convergence","Bandwidth","Reliability theory","Information technology","Delay effects","Throughput"
Publisher :
ieee
Conference_Titel :
Communication Theory, Reliability, and Quality of Service (CTRQ), 2010 Third International Conference on
Print_ISBN :
978-1-4244-7273-4
Type :
conf
DOI :
10.1109/CTRQ.2010.34
Filename :
5532768
Link To Document :
بازگشت