Comparative Analysis of Weighted Round Robin and Fair Queuing Scheduling Algorithms for the Quality of Service Assurance using Transmission Control Protocol (TCP) as Traffic Agents.


  • Ojo, Adeolu O. Information and Communication Technology Centre, Mountain Top University, Ibafo, Ogun State, Nigeria
  • Oyeniran, Oluwashina A. Department of Computer Science, Ajayi Crowther University, Oyo, Oyo State, Nigeria
  • Bakare Oluwatimileyin S. Department of Computer Science, Bowen University, Iwo, Osun State, Nigeria


Comparative analysis study


This paper presents comparative analysis of scheduling algorithms: Weighted Round Robin and Fair Queuing using throughput, fairness rate, loss rate and delay as performance metrics for quality of service assurance. This work designed a topology to implement the two scheduling algorithms using Network Simulator-2 (NS-2) installed in a Linux operating system. Thirteen nodes were created for the topology to represent the eight sources, three edge routers, one core router and one destination. The simulations were run several times to arrive at the results. Based on the simulation results, it was observed that in terms of the three out of the four performance metrics: Throughput, Fairness Rate and Loss Rate; Weighted Round Robin scheduling algorithm was better than fair queuing scheduling algorithm in the internet using transmission control protocol (TCP) as traffic agent but reverse was the case in terms of delay as performance metric.