KOMPARASI METODE PENJADWALAN LEAST CONNECTIONS DAN ROUND ROBIN DALAM WEB SERVER CLUSTERING DENGAN SKEMA LOAD BALANCING

PANDU SETYOAJI N, NIM. 10650053 (2015) KOMPARASI METODE PENJADWALAN LEAST CONNECTIONS DAN ROUND ROBIN DALAM WEB SERVER CLUSTERING DENGAN SKEMA LOAD BALANCING. Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

[img]
Preview
Text (KOMPARASI METODE PENJADWALAN LEAST CONNECTIONS DAN ROUND ROBIN DALAM WEB SERVER CLUSTERING DENGAN SKEMA LOAD BALANCING)
10650053_bab-i_iv-atau-v_daftar-pustaka.pdf

Download (4MB) | Preview
[img] Text (KOMPARASI METODE PENJADWALAN LEAST CONNECTIONS DAN ROUND ROBIN DALAM WEB SERVER CLUSTERING DENGAN SKEMA LOAD BALANCING)
10650053_bab-ii_sampai_sebelum-bab-terakhir.pdf
Restricted to Registered users only

Download (3MB)

Abstract

When a website has a high visit, it will causes to the increasing of service demand to web server which means that the web server performance is getting burdened. By using the cluster system where visitor and demand are dinamically guided to the server which is appropriate to the traffic type, location, server burden, availability of signal bandwidth, and other system measurement, it will give the increasing of web server service performance. One of the scheme that is used to increase performance of web server service using cluster system is load balancing. There are several scheduling methods in load balancing scheme in web server clustering, such as round robin scheduling method and least-connection scheduling method This study was a comparison between the round-robin scheduling method and the least connection scheduling method, which aimed to get the value of the response time parameter, throughput, requests lost, and request rate in order to compare the performance of both scheduling methods. This study uses 7 pieces scenarios where each scenario has 30 times the test. Based on this study, the time response parameter and request rate for the least connection scheduling method was superior in the low relative connections, the connection was less than or equal to 8000 connections/ second. While for the connection that more than 8000 connections/ second, round robin scheduling method was superior. Throughput parameter for round-robin scheduling method was superior in the high relative connections, the connection was more than or equal to 10000 connections /second. While for the connection that under of 10000 connections /second, the least connection scheduling method was superior. Round robin scheduling method and the least connection did not had a problem in losing connection or request lost on 0 connections /second up to 10000 connections /second. The average of highest request lost for round robin scheduling method produced a value 35.866667 conn, and for the least connection scheduling method produced a value 30.266667 conn.

Item Type: Thesis (Skripsi)
Additional Information: Arief Ikhwan Wicaksono, M.Cs.
Subjects: Tehnik Informatika
Divisions: Fakultas Sains dan Teknologi > Teknik Informatika (S1)
Depositing User: Miftahul Ulum [IT Staff]
Date Deposited: 04 Dec 2015 13:44
Last Modified: 04 Dec 2015 13:44
URI: http://digilib.uin-suka.ac.id/id/eprint/18544

Share this knowledge with your friends :

Actions (login required)

View Item View Item
Chat Kak Imum