Title: Performance of Round Robin-Based Queue Scheduling Algorithms
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.
Publication Year: 2010
Publication Date: 2010-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 13
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot