Optimizing Web Server Performance: A Comparative Analysis of Central Manager and Round Robin Load Balancing Algorithms

Abstract

Central manager algorithm has a lower average throughput compared to the round robin algorithm. This is evidenced by a significant decrease in throughput values during measurements. Central manager algorithm provides a faster average response time than round robin algorithm, despite experiencing an increase in response time values over time. Central manager algorithm shows a higher request loss rate and many requests are not served. Under normal performance conditions, both algorithms yield the same average request loss rate, achieving stable values without failed requests. The central manager algorithm ensures relatively balanced resource availability, including CPU and memory usage, across each slave web server compared to the round robin algorithm. The results show that increasing the number of clients and client requests during system testing to better observe server resource availability and load distribution performance. For future research, it is recommended to increase the number of clients in the system testing to enhance server load and to introduce client request actions on the web server to further highlight resource availability on each web server.

Author Team