The increasing complexity of modern computer systems has led to the need for effective load-balancing strategies that enable optimal resource utilization and ensure smooth operation. In this thesis, we focused on the analysis and comparison of various load-balancing algorithms used in computer networks and systems. We examined four key algorithms: Round Robin (RR), Weighted Round Robin (WRR), Least Connections (LC), and Weighted Least Connections (WLC). We created a cloud-based test environment and tested each algorithm under different loads, measuring response time, throughput, system stability, and the amount of traffic received and sent. The goal of the thesis was to study how effectively different algorithms distribute the load among servers and determine which of them is most suitable for use in specific production environments. The results showed that each algorithm has its strengths and weaknesses, and the choice of the appropriate load-balancing algorithm depends on the specific system requirements, taking into account both speed and operational stability. Understanding and applying load-balancing algorithms is crucial for optimizing the performance of computer systems, contributing to better efficiency, reliability, and resource utilization.
|
