UMM Institutional Repository

ANALISIS PERBANDINGAN ALGORITMA LOAD BALANCING PADA WEB SERVER NGINX

Azhari, Yusril Iqbal Syah (2022) ANALISIS PERBANDINGAN ALGORITMA LOAD BALANCING PADA WEB SERVER NGINX. Undergraduate (S1) thesis, Universitas Muhammadiyah Malang.

[img]
Preview
Text
PENDAHULUAN.pdf

Download (2MB) | Preview
[img]
Preview
Text
BAB I.pdf

Download (783kB) | Preview
[img]
Preview
Text
BAB II.pdf

Download (782kB) | Preview
[img]
Preview
Text
BAB III.pdf

Download (774kB) | Preview
[img] Text
BAB IV.pdf
Restricted to Registered users only

Download (662kB) | Request a copy
[img] Text
BAB V.pdf
Restricted to Registered users only

Download (774kB) | Request a copy
[img] Text
LAMPIRAN.pdf
Restricted to Registered users only

Download (151kB) | Request a copy
[img]
Preview
Text
POSTER.pdf

Download (503kB) | Preview

Abstract

A web server is something that cannot be separated from the existence of a website, so that the website can be accessed properly, the right web server will be easy to always provide good quality service and have high availability for users. Websites with high traffic can cause server performance to be heavy, resulting in decreased server performance, if not handled can result in system downs. One solution that can be used to prevent problems like this from happening is by applying the load balancing method. Load balancing is a technique for distributing traffic loads aimed at the server, which will be allocated to each server node consisting of two or more, so that the server has a balanced connection, and there is no overload on the system. Technically load balancing has several yahoos that can be used, the most commonly used yahoos are round robin and least connection. In this study, load balancing will be implemented virtually using VMware on the Centos 8 operating system. Nginx will function as a web server and load balancing. Based on the results of the analysis of the tests that have been carried out, the load balancing method using the least connection has a better level of stability than the round robin algorithm, when the load given is 5000 requests and 300 clients, the throughput obtained by the least connection algorithm is 2.7 Mbps, while the round yahoo robin is only 2.2 Mbps, besides that the response time obtained from the least connection is 305ms while the round robin is 366ms.

Item Type: Thesis (Undergraduate (S1))
Student ID: 201510130311172
Thesis Advisors: Muhammad Irfan (0705106601), Merinda Lestandy (0703039302)
Keywords: Web Server, Load Balancing, Nginx, Round Robin, Least Connection
Subjects: T Technology > T Technology (General)
T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Faculty of Engineering > Department of Electrical Engineering (20201)
Depositing User: 201510130311172 yusriliqbal
Date Deposited: 11 Mar 2022 07:36
Last Modified: 11 Mar 2022 07:36
URI : http://eprints.umm.ac.id/id/eprint/85809

Actions (login required)

View Item View Item
UMM Official

© 2008 UMM Library. All Rights Reserved.
Jl. Raya Tlogomas No 246 Malang East Java Indonesia - Phone +62341464318 ext. 150, 151 - Fax +62341464101
E-Mail : repository@umm.ac.id - Website : https://lib.umm.ac.id - Online Catalog : https://laser.umm.ac.id - Repository : https://eprints.umm.ac.id

Web Analytics

UMM Institutional Repository is powered by :
EPrints Logo