ANALISIS RESPON TIME WEB SERVER DENGAN ALGORITMA LOAD BALANCING (STUDI KASUS : WEBSITE DO SHOP PURWOKERTO)

ISNANDI, FARAH NISSA (2021) ANALISIS RESPON TIME WEB SERVER DENGAN ALGORITMA LOAD BALANCING (STUDI KASUS : WEBSITE DO SHOP PURWOKERTO). S1 thesis, UNIVERSITAS MUHAMMADIYAH PURWOKERTO.

[img]
Preview
Text
FARAH NISSA ISNANDI_Cover.pdf

Download (1MB) | Preview
[img]
Preview
Text
FARAH NISSA ISNANDI_BAB 1.pdf

Download (831kB) | Preview
[img]
Preview
Text
FARAH NISSA ISNANDI_BAB 2.pdf

Download (1MB) | Preview
[img] Text
FARAH NISSA ISNANDI_BAB 3.pdf
Restricted to Registered users only

Download (860kB)
[img] Text
FARAH NISSA ISNANDI_BAB 4.pdf
Restricted to Registered users only

Download (1MB)
[img] Text
FARAH NISSA ISNANDI_BAB 5.pdf
Restricted to Registered users only

Download (775kB)
[img]
Preview
Text
FARAH NISSA ISNANDI_Daftar Pustaka.pdf

Download (831kB) | Preview
[img] Text
FARAH NISSA ISNANDI_Lampiran.pdf
Restricted to Registered users only

Download (2MB)

Abstract

Currently, the use of access to services on the Internet is very important. One of these services is an information system service in the form of a web. If the service cannot be accessed, the information someone needs will not be obtained. The use of multiple servers also makes the server load lighter because the request for access to the server is shared between several servers at once. This is commonly known as a web server load balancer. In the web server load balancer there are also methods to balance the server load. For example, as a medium for conducting retail business processes http://doshop-purwokerto.com/ which serve the needs of users in everyday life. Load balancing is the act of discussing network traffic in a group of servers. From the results of the test analysis using Kruskal Wallis test, with load balancing round roubin algorithm, it is found that there is a different in the value of response time with load balancing algorithm. The fastest request from 1000 with a speed of 72 Kbp happened at request to 60. While request 300 is the fastest on the ip hash algorithm with a speed of 69.890 Kbps. While request 2000 with a speed of 132 Kbps on request 1725.

Item Type: Thesis (S1)
Uncontrolled Keywords: Load Balancing, Round Robin
Subjects: Q Science > QA Mathematics > QA76 Computer software
Divisions: Fakultas Teknik > Teknik Informatika S1
Depositing User: wulan
Date Deposited: 16 May 2023 02:33
Last Modified: 16 May 2023 02:33
URI: https://repository.ump.ac.id:80/id/eprint/15613

Actions (login required)

View Item View Item