Analisis Perbandingan Algoritma Static Round-Robin dengan Least-Connection Terhadap Efisiensi Load Balancing pada Load Balancer Haproxy

Abstract

In IT networking, load balancing used to share the traffic between backend servers. The idea is to make effective and efficient load sharing. Load balancing uses scheduling algorithms in the process includes Static round-robin and Least-connection algorithm. Haproxy is a load balancer that can be used to perform the load balancing technique and run by Linux operating systems. In this research, Haproxy uses 4 Nginx web server as backend servers. Haproxy act as a reverse proxy which accessed by the client while the backend servers handle HTTP requests. The experiment involves 20 Client PCs that are used to perform HTTP requests simultaneously, using the Static round-robin algorithm and Least-connection on the haproxy load balancer alternately. When using Static round-robin algorithm, the results obtained average percentages of CPU usage successively for 1 minute; 5 minutes; and 15 minutes are; 0.1%; 0.25%; and 1.15% with average throughput produced is 14.74 kbps. Average total delay produced 64.3 kbps. The average total delay and jitter is 181.3 ms and 11.1 ms, respectively. As for the Least-connection algorithm average percentage obtained successively for 1 minute; 5 minutes; and 15 minutes are 0.1%; 0.3%; and 1.25% with the average throughput produced is 14.66 kbps. The average total delay and jitter is 350.3 ms and 24.5 ms, respectively. It means Static round-robin algorithm is more efficient than the algorithms Least-connection because it can produce a greater throughput with less CPU load and less total delay.

Analisis Perbandingan Algoritma Round-Robin dengan Least-Connection Terhadap Peningkatan Nilai Throughput Pada Layanan Web Server

“…Round-robin menjalankan prosesnya melalui seluruh node server yang dibutuhkan yang selaras disesuaikan dengan penetapan beban oleh tiap-tiap server. Konsep utama dari algoritma ini yaitu melalui penggunaan time sharing, yang fokusnya adalah memberikan proses antrian dengan cara bergantian [23]. Gambar 2 berikut ini menunjukkan proses algoritma round-robin.…”

Computer Networks Optimization using Load Balancing Algorithms on the Citrix ADC Virtual Server

“…The round-robin algorithm divides all server nodes to be treated equally according to the load assigned by each server but does not allow dynamic load switching due to the nature of static loads. There is no limit to the number of active servers on the backend [4]. The least response time uses the round-robin method plus a parameter to select the server with the least connection and shortest response time [3].The least connection works by sending a request to the server, where the selected server is the server with the least number of connections.…”

“…Many previous studies have discussed the implementation of load balancing and algorithm comparisons in it. In the implementation of load balancing itself, various tools are used, such as HA Proxy [4], Nginx [5][6]. For the comparison of the algorithm itself, in previous studies that have been done, among others, the…”

“…comparison of the round-robin algorithm with the least connection [4] [7], the comparison of the round-robin algorithm, the least connection, and the ratio [8], the comparison of the round-robin, least packet and least connection [9]. From some of these studies, the researcher tries to raise the least response time algorithm as one of the algorithms tested for performance by being compared with round-robin and least connection algorithms then implemented in Citrix ADC VPX.…”

Implementasi High Availability Cluster Web Server Menggunakan Virtualisasi Container Docker

“…Sebelumnya berdasarkan penelitian yang telah dilakukan oleh Hasta Triangga dkk dihasilkan bahwa penggunaan algoritma static round-robin lebih efisien. Hal ini ditunjukkan oleh grafik CPU load dimana ketika menggunakan algoritma static round-robin nilai rata-rata yang diperoleh untuk beban CPU sedikit lebih kecil dan throghput lebih besar dibandingkan dengan penggunaan algrotima least-connection, nilai yang diperoleh untuk beban CPU adalah 0.1 %; 0,25%; dan 1.15% [2]. Penelitian yang dilakukan oleh Maya Rosalia dkk dengan sistem Haproxy load balancer dapat melayani hingga 2352.937 req/s sedangkan pada single virtual server hanya sampai 1428.161 req/s [3].…”