Implementasi Algoritma A* (A-Star) dan Greedy Dalam Penentuan Routing Pada Wide Area Network (WAN)
-
Alfry Aristo Jansen Sinlae
*
Universitas Katolik Widya Mandira, Kupang,
Indonesia
- Rini Nuraini Universitas Nasional, Jakarta, Indonesia
- Dedy Alamsyah Universitas Muhammadiyah Tangerang, Tangerang, Indonesia
- Sampurna Dadi Riskiono Universitas Teknokrat Indonesia, Bandarlampung, Indonesia (*) Corresponding Author
Abstract
The continuous development of the internet has led to changes in routing complexity. In the context of a wide area network (WAN), network flow optimization becomes a major issue in the selection of the fastest route, which involves routing protocols. Algorithms in routing protocols are designed to determine the shortest path. Therefore, studies are needed regarding how to build a routing algorithm that can be used to get the shortest path in each process. This study aims to reduce network workload and compare the computation involved in determining the shortest path using the Greedy algorithm and the A* algorithm. The simulation results show that the A* algorithm is superior to greedy. The measurement results show that the final cost of the Greedy algorithm is 44 and the A* algorithm is 38. Taking into account the heuristic value for each node, the A* algorithm is superior to the Greedy algorithm in determining the shortest path.
Downloads
References
M. Tahir, Pengantar Jaringan Komputer Dasar. Malang: CV Literasi Nusantara Abadi, 2023.
D. F. Waidah, D. D. Putra, and S. Syarifuddin, “Perancangan Sistem Jaringan dan Komunikasi Data PT. Wira Penta Kencana,” J. TIKAR, vol. 2, no. 2, pp. 140–152, 2021.
R. D. Marcus, R. A. Saputro, and F. Y. Pamuji, “Optimasi Jaringan Routing Open Shortest Path First Dengan Menggunakan Multiprotocol Label Switching,” BRILIANT J. Ris. dan Konseptual, vol. 5, no. 1, pp. 612–618, 2020.
S. Pujowati and B. B. Harianto, Pengenalan Dasar Jaringan Komputer. Magelang: Penerbit Pustaka Rumah C1nta, 2021.
M. F. Pratama, A. S. Y. Irawan, and A. Suharso, “Implementasi Routing Pada Jaringan Local Area Network Menggunakan Router di PT. Surya Baja Teknik Dan Surya Rasa (Studi kasus: PT. Surya Baja Teknik dan Surya Rasa),” J. Ilm. Wahana Pendidik., vol. 6, no. 3, pp. 295–307, 2020, doi: 10.5281/zenodo.5267122.
S. D. Riskiono and D. Darwis, “Peran Load Balancing Dalam Meningkatkan Kinerja Web Server Di Lingkungan Cloud,” Krea-TIF, vol. 8, no. 2, p. 1, 2020, doi: 10.32832/kreatif.v8i2.3503.
I. Ilahi, Administrasi Infrastruktur Jaringan. Surabaya: XP Solution Surabaya, 2020.
I. Komang and S. D. Riskiono, “Rancang Bangun Sistem Pengunci Loker Otomatis Dengan Kendali Akses Menggunakan RFID dan SIM 800L,” J. Ilm. Mhs. Kendali dan List., vol. 1, no. 1, pp. 33–41, 2020.
N. N. Sania and I. Sari, “Implementasi Rencana Perjalanan Wisata di Kota Bogar Menggunakan Algoritma Greedy Berbasis Website,” J. Ilm. Teknol. dan Rekayasa, vol. 24, no. 2, pp. 114–130, 2019.
M. N. Santi and M. Mulyani, “Optimasi Biaya Jalur Tercepat Indarung-Unitas Menggunakan Algoritma Greedy,” Menara Ilmu, vol. XIII, no. 11, pp. 60–69, 2019.
A. Hermawan and A. S. Tiwa, “Penerapan Algoritma A-Star untuk Pencarian Tempat Kuliner di Kota Tangerang,” J. Sist. dan Inform., vol. 15, no. 2, pp. 104–114, 2021, doi: 10.30864/jsi.v15i2.335.
B. T. D. Irianto, S. Andryana, and A. Gunaryati, “Penerapan Algoritma A-Star Dalam Mencari Jalur Tercepat dan Pergerakan NonPlayer Character Pada Game Petualangan Labirin Tech-Edu,” J. Media Inform. Budidarma, vol. 5, no. 3, p. 953, 2021, doi: 10.30865/mib.v5i3.3094.
E. G. Agung, D. Eridani, and A. Fauzi, “Implementasi Metode Pathfinding dengan Algoritma A* pada Game Rogue-like menggunakan Unity,” Indones. J. Comput., vol. 7, no. December, pp. 81–94, 2022, doi: 10.34818/indojc.2022.7.3.677.
Y. H. Nuryoso, P. Pradjoko, and L. Lelah, “Implementasi Algoritma A-Star Untuk Mencari Rute Terpendek Angkutan Umum Kota (Studi Kasus Pada Rute Angkutan Umum Kota di Kota Sukabumi),” JSTIE (Jurnal Sarj. Tek. Inform., vol. 8, no. 1, p. 21, 2020, doi: 10.12928/jstie.v8i1.13922.
Y. Darnita and R. Toyib, “Penerapan Algoritma Greedy Dalam Pencarian Jalur Terpendek Pada Instansi-Instasi Penting Di Kota Argamakmur Kabupaten Bengkulu Utara,” J. Media Infotama, vol. 15, no. 2, 2019, doi: 10.37676/jmi.v15i2.867.
M. Akbar, Q. Quraysh, and R. I. Borman, “Otomatisasi Pemupukan Sayuran Pada Bidang Hortikultura Berbasis Mikrokontroler Arduino,” J. Tek. dan Sist. Komput., vol. 2, no. 2, pp. 15–28, 2021.
R. Harry, S. Pamungkas, S. D. Riskiono, and Y. Arya, “Rancang Bangun Sistem Penyiraman Tanaman Sayur Berbasis Arduino Dengan Sensor Kelembaban Tanah,” J. Ilm. Mhs. Kendali dan List., vol. 1, no. 1, pp. 23–32, 2020.
R. D. Septiana, D. A. Punkastyo, and N. Nugroho, “Implementasi Algoritma Greedy dan Algoritma A* Untuk Penentuan Cost Pada Routing Jaringan,” KLIK Kaji. Ilm. Inform. dan Komput., vol. 3, no. 2, pp. 181–187, 2022.
A. Amarrulloh and S. Sidik, “Perancangan dan Implementasi Topologi WAN Menggunakan Routing Dynamic BGP Antar Cabang di PT Bank Woori Saudara Tbk,” Evolusi J. Sains dan Manaj., vol. 10, no. 1, pp. 10–19, 2022.
M. A. Arsyad, D. Supriyadi, V. Anggie, L. N. Hidayah, and D. Putri, “Penerapan Algoritma A Star Untuk Pencarian Rute Terpendek Puskesmas Rawat Inap Di Banyumas,” in Conference on Electrical Engineering, Telematics, Industrial Technology, and Creative Media, 2019, pp. 74–82.
H. Puja Kekal, W. Gata, S. Nurdiani, A. J. Setio Rini, and D. Sely Wita, “Analisa Pencarian Rute Tercepat Menuju Tempat Wisata Pulau Kumala Kota Tenggarong Menggunakan Algoritma Greedy,” J. Ilm. Ilmu Komput., vol. 7, no. 1, pp. 9–15, 2021, doi: 10.35329/jiik.v7i1.179.
M. Furqan, Y. R. Nasution, and T. S. Nurdianti, “Penerapan Algoritma Greedy Untuk Menentukan Rute Terpendek Antar Klinik Gigi,” CSRID (Computer Sci. Res. Its Dev. Journal), vol. 12, no. 3, p. 170, 2021, doi: 10.22303/csrid.12.3.2020.170-178.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Implementasi Algoritma A* (A-Star) dan Greedy Dalam Penentuan Routing Pada Wide Area Network (WAN)
Pages: 551-557
Copyright (c) 2023 Alfry Aristo Jansen Sinlae, Rini Nuraini, Dedy Alamsyah, Sampurna Dadi Riskiono
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
