Melola Discovery

← Melola Discovery

Jurnal Tanpa peringkat SINTA

EVALUASI METODE LOAD BALANCING Dan FAULT TOLERANCE PADA SISTEM DATABASE SERVER APLIKASI CHAT

Edu Komputika Journal · Vol. 5 No. 1 (2018) · hlm. 51–61

DOI
10.15294/edukomputika.v5i1.23029
ISSN
2599-297X, 2252-6811
Terbit
2018-08-15
Penerbit
Jurusan Teknik Elektro Universitas Negeri Semarang
Bahasa
eng

Abstrak

Abstract The development of social network applications has growth so fast with various applications supported by smart tools as multiplatform to used it. Several applications that used by user are the chat and media social app. However, there is problem is the number of users accessing the chat service is large. This condition makes communication into database server can be stop and loss of data. It is caused by excessive load received by a single server database. Therefore, this study designs a database server to solve a lot of users of communication server and storage capacity into database server more than one. This is important because to increase availibiliy of services for each users request. This study used a method of distribution of communications service request for each database server. Distribution of communication service request used a load balancing method and HAPRoxy with scheduling method. There are two algorithms in scheduling method are round robin and least connection algorithm. Both of algorithms were evaluated. compared, and used in database server more than one. The result shown average of least connection algorithm has value of response time 32.421 ms is smaller than round robin algorithm 35.813 ms. While on the throughput, least algorithm has big value 211.267 Kb/s than round robin algorithm has value 210.298 Kb/s. The result shown the number of packet least connection algorithm are big and better than round robin algortihm with load balancing implementation for distribution of server communication on database server more than one able to solve a lot of services communication. Keywords: load balancing, database server chat, least connection, round robin, response time, throughput

Jaringan kolaborasi para penulis

29 penulis · 59 tautan kepenulisan bersama · 10 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Universitas Gadjah Mada
  • Institut Teknologi Telkom Purwokerto
  • Telkom University
  • Universitas Amikom Yogyakarta
  • Sriwijaya University
  • Politeknik Negeri Semarang
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Risanuri HidayatUniversitas Gadjah Mada3
I Wayan MustikaUniversitas Gadjah Mada3
Anggun Fitrian IsnawatiInstitut Teknologi Telkom Purwokerto3
Vera SuryaniTelkom University2
Widyawan WidyawanUniversitas Gadjah Mada2
Oyas WahyunggoroUniversitas Gadjah Mada2
Adha Imam CahyadiUniversitas Gadjah Mada2
Hendri Himawan TriharmintoUniversitas Gadjah Mada2
Igi ArdiyantoUniversitas Gadjah Mada2
Noor Akhmad SetiawanUniversitas Gadjah Mada2
Nur Annisa TresnasariUniversitas Gadjah Mada1
Adhistya Erna PermanasariUniversitas Gadjah Mada1
Indriana HidayahUniversitas Gadjah Mada1
Sri Suning KusumawardaniUniversitas Gadjah Mada1
Brillian StefaniUniversitas Gadjah Mada1
I Made Artha AgastyaUniversitas Amikom Yogyakarta1
Noor Akhmad SetiawanAfiliasi tidak diketahui1
Adi WijayaUniversitas Gadjah Mada1
WidyawanAfiliasi tidak diketahui1
Warsun NajibUniversitas Gadjah Mada1
Rifkie PrimarthaSriwijaya University1
Muhammad AnifPoliteknik Negeri Semarang1
Mustika I WayanUniversitas Gadjah Mada1
Hanung Adi NugrohoUniversitas Gadjah Mada1
Fauziazzuhry RahadianUniversitas Gadjah Mada1
Ratna Lestari Budiani BuanaUniversitas Gadjah Mada1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unnes.ac.id/sju/index.php/edukom/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">EVALUASI METODE LOAD BALANCING Dan FAULT TOLERANCE PADA SISTEM  DATABASE SERVER APLIKASI CHAT</dc:title>
	<dc:creator>Hamka, Cakra Aminuddin</dc:creator>
	<dc:creator>Adji, Teguh Bharata</dc:creator>
	<dc:creator>Sulistyo, Selo</dc:creator>
	<dc:description xml:lang="en-US">Abstract
The development of social network applications has growth so fast with various applications supported by smart tools as multiplatform to used it. Several applications that used by user are the chat and media social app. However, there is problem is the number of users accessing the chat service is large. This condition makes communication into database server can be stop and loss of data. It is caused by excessive load received by a single server database. Therefore, this study designs a database server to solve a lot of users of communication server and storage capacity into database server more than one. This is important because to increase availibiliy of services for each users request. This study used a method of distribution of communications service request for each database&amp;nbsp; server. Distribution of communication service request used a load balancing method and HAPRoxy with scheduling method. There are two algorithms in scheduling method are round robin and least connection algorithm. Both of algorithms were evaluated. compared, and used in database server more than one. The result shown average of least connection algorithm has value of response time 32.421 ms is smaller than round robin algorithm 35.813 ms. While on the throughput, least algorithm has big value 211.267 Kb/s than round robin algorithm has value 210.298 Kb/s. The result shown the number of packet least connection algorithm are big and better than round robin algortihm with load balancing implementation for distribution of server communication on database server more than one able to solve a lot of services communication.
Keywords: load balancing, database server chat, least connection, round robin, response time, throughput</dc:description>
	<dc:publisher xml:lang="en-US">Jurusan Teknik Elektro Universitas Negeri Semarang</dc:publisher>
	<dc:date>2018-08-15</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unnes.ac.id/sju/edukom/article/view/23029</dc:identifier>
	<dc:identifier>10.15294/edukomputika.v5i1.23029</dc:identifier>
	<dc:source xml:lang="en-US">Edu Komputika Journal; Vol 5 No 1 (2018): Edu Komputika Journal; 51-61</dc:source>
	<dc:source>2599-297X</dc:source>
	<dc:source>2252-6811</dc:source>
	<dc:source>10.15294/edukomputika.v5i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.unnes.ac.id/sju/edukom/article/view/23029/11273</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Edu Komputika Journal</dc:rights>
</oai_dc:dc>