Queue Scheduling Algorithms: A Comparative Analysis


  • Essam F. Alnatsheh Dep. of Informatics Engineering, College of Engineering AMA International University Salmabad, Kingdom of Bahrain




Queue scheduling algorithms, first in first out scheduling, last in first out scheduling, random packet drop scheduling


Congestion control and reduction is paramount in enhancing the performance and speed of communication networks. Despite its efficiency in improving the speed and performance of communication networks, it is imperative to mention that the technique exhibit several issues, such as scheduling algorithms. This paper presents a comparison of different results associated with different scheduling algorithms. Multisource was used to simulate and test different scheduling algorithms, including First In First Out (FIFO), Random Packet Drop, and Last In First Out (LIFO). The comparison was made by analyzing different results, including the average delay vs arrival rate, average buffer utilization vs arrival rate, and packet loss ration vs arrival rate. According to the results, it is evident that the average buffer utilization and average packet delays increased as the rate of data transmitted through the network increased. There was no significant change noticed in the average buffer utilization in all the three algorithms. However, the packet loss ratio was high in Random Packet Loss algorithm than in both FIFO and LIFO for slower arrival rates below 1000. Similarly, FIFO exhibited a significantly high average packet delay than both LIFO and Random Packet Drop algorithms.




How to Cite

Alnatsheh, E. F. (2020). Queue Scheduling Algorithms: A Comparative Analysis. International Journal of Innovative Computing, 10(1). https://doi.org/10.11113/ijic.v10n1.257



Computer Science