Melola Discovery

← Melola Discovery

Jurnal SINTA 2

Algoritma Genetika dalam Menentukan Rute Optimal Topologi Cincin pada WAN

Jurnal Teknologi Informasi dan Ilmu Komputer (JTIIK) · Vol. 4 No. 1 (2017) · pp. 62–68

DOI
10.25126/jtiik.201741204
ISSN
2528-6579, 2355-7699
Published
2017-03-23
Publisher
Fakultas Ilmu Komputer, Universitas Brawijaya
Language
en

Abstract

AbstrakImplementasi jaringan komputer memiliki banyak masalah, terutama pada Wide Area Network (WAN), salah satunya adalah masalah routing. Routing masalah adalah bagaimana melakukan transmisi data antara node dengan jalur tercepat, terutama dalam topologi ring. Dalam topologi ring, setiap simpul hanya bisa dilalui oleh sebanyak satu. Untuk mengatasi masalah ini, kami menggunakan algoritma genetika. Kami telah diuji pada arsitektur wan dari PT. XYZ terletak di Kotawaringin Barat, Kalimantan Tengah. Dengan ukuran populasi 100, metode seleksi elitisme, dan tingkat mutasi 0,08, hasil yang optimal diperoleh dengan jarak akhir adalah 44. Penggunaan metode seleksi elitisme dan nilai rate mutasi sangat berpengaruh untuk mendapatkan rute yang optimal.Kata kunci: Wide Area Network, Routing Problem, Genetic Algorithm, Ring Topology. AbstractThe implementation of a computer network has a lot of problems, especially on Wide Area Network (WAN), one of them is a routing problem. Routing problem is how to perform data transmission between nodes with the fastest path, especially in a ring topology. In a ring topology, every node can only be passed by as much as one. To solve this problem, we used a genetic algorithm. We have tested on the wan architecture of PT. XYZ located in Kotawaringin Barat, Central Kalimantan. With a population size of 100, elitism selection method, and the mutation rate of 0.08, an optimal result is obtained with the final distance is 44. The use of elitism selection method and mutation rate value is very influential to get the optimal route.Keywords: Wide Area Network, Routing Problem, Genetic Algorithm, Ring Topology

Collaboration network of the authors

5 authors · 7 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Institut Teknologi Sepuluh Nopember
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Tony Dwi SusantoInstitut Teknologi Sepuluh Nopember1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://jtiik.ub.ac.id/index.php/jtiik/en/oai, first harvested 27 Okt 2026, last seen 1 Nov 2026.
Original metadata (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="id">Algoritma Genetika dalam Menentukan Rute Optimal Topologi Cincin pada WAN</dc:title>
	<dc:creator xml:lang="en">Muftikhali, Qilbaaini Effendi</dc:creator>
	<dc:creator xml:lang="en">Danar, Arnoldus Yansen</dc:creator>
	<dc:creator xml:lang="en">Kusumawati, Aris</dc:creator>
	<dc:creator xml:lang="en">Hidayat, Syukron</dc:creator>
	<dc:description xml:lang="id">AbstrakImplementasi jaringan komputer memiliki banyak masalah, terutama pada Wide Area Network (WAN), salah satunya adalah masalah routing. Routing masalah adalah bagaimana melakukan transmisi data antara node dengan jalur tercepat, terutama dalam topologi ring. Dalam topologi ring, setiap simpul hanya bisa dilalui oleh sebanyak satu. Untuk mengatasi masalah ini, kami menggunakan algoritma genetika. Kami telah diuji pada arsitektur wan dari PT. XYZ terletak di Kotawaringin Barat, Kalimantan Tengah. Dengan ukuran populasi 100, metode seleksi elitisme, dan tingkat mutasi 0,08, hasil yang optimal diperoleh dengan jarak akhir adalah 44. Penggunaan metode seleksi elitisme dan nilai rate mutasi sangat berpengaruh untuk mendapatkan rute yang optimal.Kata kunci: Wide Area Network, Routing Problem, Genetic Algorithm, Ring Topology. AbstractThe implementation of a computer network has a lot of problems, especially on Wide Area Network (WAN), one of them is a routing problem. Routing problem is how to perform data transmission between nodes with the fastest path, especially in a ring topology. In a ring topology, every node can only be passed by as much as one. To solve this problem, we used a genetic algorithm. We have tested on the wan architecture of PT. XYZ  located in Kotawaringin Barat, Central Kalimantan. With a population size of 100, elitism selection method, and the mutation rate of 0.08, an optimal result is obtained with the final distance is 44. The use of elitism selection method and mutation rate value is very influential to get the optimal route.Keywords: Wide Area Network, Routing Problem, Genetic Algorithm, Ring Topology</dc:description>
	<dc:publisher xml:lang="en">Fakultas Ilmu Komputer, Universitas Brawijaya</dc:publisher>
	<dc:date>2017-03-23</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://jtiik.ub.ac.id/index.php/jtiik/article/view/204</dc:identifier>
	<dc:identifier>10.25126/jtiik.201741204</dc:identifier>
	<dc:source xml:lang="id">Jurnal Teknologi Informasi dan Ilmu Komputer; Vol 4 No 1: Maret 2017; 62-68</dc:source>
	<dc:source xml:lang="en">Jurnal Teknologi Informasi dan Ilmu Komputer; Vol. 4 No. 1: Maret 2017; 62-68</dc:source>
	<dc:source>2528-6579</dc:source>
	<dc:source>2355-7699</dc:source>
	<dc:source>10.25126/jtiik.201741</dc:source>
	<dc:language>en</dc:language>
	<dc:relation>https://jtiik.ub.ac.id/index.php/jtiik/article/view/204/pdf</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2017 Jurnal Teknologi Informasi dan Ilmu Komputer</dc:rights>
</oai_dc:dc>