Negara, Lucky Ronny Chandra (2018) Analisis Dan Implementasi Load Balancing Pada Web Server Dengan Algoritme Shortest Delay Pada Software Defined Network. Sarjana thesis, Universitas Brawijaya.
Abstract
Software Defined Network (SDN) merupakan konsep jaringan komputer yang memisahkan antara control plane dan data plane. Cara komunikasi antara control plane dan data plane melalui protocol openflow. Dalam kebutuhan jaringan yang semakin kompleks, SDN sudah mulai di kembangkan pada beberapa tahun terakhir ini dan sudah banyak yang diimplementasikan seperti load balancing. Load balancing merupakan metode pendistribusian kinerja server dalam melayani banyaknya permintaan dari client. Pada konteks jaringan clientserver algoritme load balancing yang paling banyak digunakan adalah algoritme round-robin, tetapi algoritme tersebut tidak memperhatikan delay yang ada pada jaringan. Sehingga delay merupakan aspek penting dalam pemilihan server pada load balancing untuk menentukan berapa waktu yang dibutuhkan dalam berpindah dari alamat asal ke alamat tujuan. Dalam penelitian ini algoritme load balancing yang digunakan adalah algoritme shortest delay. Algoritme shortest delay mengalokasikan koneksi ke server dengan delay terendah. Pengujian ini untuk mengukur kinerja dari algoritme meliputi throughput, connection rate dan reply time. Data yang didapat menggunakan algoritme shortest delay akan di bandingkan dengan algoritme round robin dengan parameter pengujian yang sama. Sistem load balancing dengan algoritme shortest delay pada pengujian throughput memberikan nilai rata-rata koneksi per detik cukup tinggi yakni 3800,45 KB/s dibandingkan dengan algoritme round robin yakni 3724,26 KB/s. Pada algoritme shortest delay nilai rata-rata pada pengujian connection rate yakni 3,78 conn/s dibandingkan dengan nilai rata-rata algoritme round robin yakni 3,70 conn/s. Untuk hasil reply time pada algoritme shortest delay lebih unggul dengan nilai rata-rata 177,46 ms dibandingkan dengan nilai rata-rata round robin 266,22 ms.
English Abstract
Software Defined Network (SDN) is a computer network concept that separates between control plane and data plane. Way of communication between control plane and data plane through openflow protocol. In an increasingly complex network requirements, SDN has already started to developed in the last few years and there have been many implementations such as load balancing. Load balancing is the method of distributing server performance in serving the larger number of requests from the client. In the context of the client-server network load balancing algorithm is the mostwidely user is the round robin algorithm, but the algorithm does not pay attention to the delay which exits on the network. So, the delay is an important aspect in the selection of load balancing on server to determine how the time needed in the move from source to destination. In the research the algorithm of load balancing used is the algorithm shortest delay. Shortest delay algorithm to allocate a connection to the server with the lowest delay. The test to measure the performance of the algorithm include throughput, connection rate and reply time. The data obtained using the algorithm of shortest delay will be compared wth the round robin algorithm with the same test parameter. The load balancing system with shortest delay algorithm at throughput provides a relatively high average connection value per second of 3800.45 KB/s compared to value average round robin algorithm that is 3724,26 KB/s. In the shortest delay algorithm the average value at connection rate is 3.78 conn/s compared to the average value of round robin 3.70 conn/s. For the result of reply time on shortest delay algorithm is superior with average value 177,46 ms compared with average value round robin 266,22 ms.
| Item Type: | Thesis (Sarjana) |
|---|---|
| Identification Number: | SKR/FTIK/2018/164/051801151 |
| Uncontrolled Keywords: | Software Defined Network, Load Balancing, Web Server, Algoritme Shortest Delay |
| Subjects: | 000 Computer science, information and general works > 004 Computer science > 004.015 1 Finite mathematic |
| Divisions: | Fakultas Ilmu Komputer > Teknik Informatika |
| Depositing User: | Yusuf Dwi N. |
| Date Deposited: | 28 May 2018 02:32 |
| Last Modified: | 26 Oct 2021 08:59 |
| URI: | http://repository.ub.ac.id/id/eprint/11147 |
Preview |
Text
BAB V.pdf Download (645kB) | Preview |
Preview |
Text
9. LAMPIRAN.pdf Download (351kB) | Preview |
Preview |
Text
BAGIAN DEPAN.pdf Download (172kB) | Preview |
Preview |
Text
BAB VI.pdf Download (86kB) | Preview |
Preview |
Text
BAB I.pdf Download (110kB) | Preview |
Preview |
Text
DAFTAR PUSTAKA.pdf Download (66kB) | Preview |
Preview |
Text
BAB II.pdf Download (241kB) | Preview |
Preview |
Text
BAB III.pdf Download (240kB) | Preview |
Preview |
Text
BAB IV.pdf Download (819kB) | Preview |
Actions (login required)
 |
View Item |