Perbandingan Algoritma Round Robin dan Algoritma Least Connection pada Haproxy untuk Load Balancing Web Server

Abstract

Sekolah Menengah Atas (SMA), Sekolah Menengah Kejuruan (SMK) or equivalent hold a grade promotion test using the Computer Based Test (CBT). However, in its implementation, there are problems, one of which is the server load. This is caused by user requests that exceed the server's capabilities. To overcome these problems, we use web server load balancing using Haproxy. However, the use of web server load balancing often experiences data inconsistencies per server. Therefore, database replication is used that can guarantee data consistency in web server load balancing. This study uses a descriptive approach to the PPDIOO network system design method. There are two load balancing algorithms compared, namely the round-robin algorithm and the least connection algorithm. Based on the httperf test results, the throughput parameters of the two algorithms obtain the same average value of 99.5 Kb/second. In testing the response time parameter, the least connection algorithm is superior at 6.9 ms compared to round-robin, which has an average value of 7.2 ms. However, in testing the CPU Utilization parameter, the round-robin algorithm is worth 23.7% superior to the least algorithm connection is 24.3%.