Simulasi Algoritma A* Dan Dijkstra Pada WAN
DOI:
https://doi.org/10.30872/jim.v12i2.652Keywords:
Wide Area Network (WAN), Routing Protocol, Algoritma Dijkstra, Algoritma A*, Simulasi Proses Komputasi,Abstract
Perubahan kompleksitas jalur pada internet sejalan dengan meningkatnya perkembangan internet. Sehingga Network flow optimization menjadi permasalahan utama terkait dengan pemilihan rute terpendek (routing protocol) di balik kompleksitas jalur pada WAN. Algoritma yang digunakan pada routing protocol dirancang untuk memiliki kemampuan pencarian rute terpendek. Dengan perkembangan berbagai algoritma saat ini, apakah algoritma penentuan rute terpendek pada graf seperti A* dapat diterapkan untuk penentuan rute terpendek pada jaringan. Fokus pada penelitian ini yaitu mengetahui dan membandingkan proses komputasi dalam pencarian rute terpendek dengan algoritma Dijkstra dan algoritma A* guna mengurangi beban kerja jaringan. Penelitian dilakukan dengan simulasi pada topologi mesh yang menggunakan fiber link. Berdasarkan hasil simulasi dapat diketahui bahwa algoritma A* memiliki proses komputasi yang lebih sedikit dan jarak yang dihasilkan lebih pendek dibandingkan dengan algoritma Dijkstra. Oleh karena itu, algoritma A* dapat dipertimbangkan sebagai algoritma pada routing protocol.
References
APJII, “Asosiasi Penyelenggara Jasa Internet Indonesia.” [Online]. Available: https://www.apjii.or.id/. [Accessed: 26-Nov-2016].
Larry L. Learn, “NETWORKS: A Review of Their Technology, Architecture, and Implementation,” Libr. Hi Tech, vol. 6, no. 2, pp. 19–49, Feb. 1988.
H. Kaur and R. K. Gurm, “A SURVEY ON WAN TECHNOLOGIES,” Int. J. Multi Discip. Eng. Bus. Manag. IJMDEBM, vol. 3, no. 2, pp. 62–65, 2013.
W. Li, D. Guo, K. Li, H. Qi, and J. Zhang, “iDaaS: Inter-Datacenter Network as a Service,” IEEE Trans. Parallel Distrib. Syst., vol. PP, no. 99, pp. 1–1, 2015.
L. Qi and M. Schneider, “Trafforithm: A traffic-aware shortest path algorithm in real road networks with traffic influence factors,” in 2015 1st International Conference on Geographical Information Systems Theory, Applications and Management (GISTAM), 2015, pp. 1–8.
G. S. Malkin, “RIP Version 2.” [Online]. Available: https://tools.ietf.org/html/rfc2453.html. [Accessed: 22-Nov-2016].
J. Moy, “OSPF Version 2.” [Online]. Available: https://tools.ietf.org/html/rfc2178#page-206. [Accessed: 22-Nov-2016].
F. Dabaghi, Z. Movahedi, and R. Langar, “A survey on green routing protocols using sleep-scheduling in wired networks,” J. Netw. Comput. Appl., vol. 77, pp. 106–122, Jan. 2017.
M. G. Mahfudhi, “Penerapan Algoritma Dijkstra pada Link State Routing Protocol untuk Mencari Jalur Terpendek,” Strategi Algoritma, 2010.
S. Syamsu, “Bab 6 Konsep Routing.” .
A. Cianfrani, V. Eramo, M. Listanti, M. Marazza, and E. Vittorini, “An Energy Saving Routing Algorithm for a Green OSPF Protocol,” in 2010 INFOCOM IEEE Conference on Computer Communications Workshops, 2010, pp. 1–5.
J. Galán-Jiménez and A. Gazo-Cervero, “Using bio-inspired algorithms for energy levels assessment in energy efficient wired communication networks,” J. Netw. Comput. Appl., vol. 37, pp. 171–185, Jan. 2014.
A. Fachrian, “Rancang Bangun Penentuan Rute Terpendek Angkutan Kota Di Surabaya Berbasis Android Dengan Menggunakan Algoritma A*,” skripsi, UNIVERSITAS AIRLANGGA, 2015.
M. A. Djojo and Karyono, “Pengukuran Beban Komputasi Algoritma Dijkstra, A , dan Floyd- Warshall pada Perangkat Android,” 1 Vol5 Sept. 2013, vol. 0, no. 0, Sep. 2013.
W. Setiawan, “Pembahasan Pencarian Lintasan Terpendek Menggunakan Algoritma Dijkstra dan A*,” J. Mat. ITB.
Y. Yuliani and F. Agus, “WEBGIS PENCARIAN RUTE TERPENDEK MENGGUNAKAN ALGORITM A STAR (A*) (Studi Kasus: Kota Bontang) 1) Yuliani,” J. Inform. Mulawarman JIM, vol. 8, no. 2, pp. 50–55, Jun. 2016.
“Dijkstra’s algorithm,” Wikipedia. 09-Nov-2016.
P. S. N. Ananda, S. Wahjuni, and E. P. Giri, “Penentuan Rute Terpendek Menggunakan Variasi Fungsi Heuristik Algoritme A* Pada Mobile Devices,” J. Ilm. Ilmu Komput., vol. 8, no. 2, 2010.
Downloads
Published
Issue
Section
License
Copyright Transfer StatementThe copyright of this article is transferred to Informatika Mulawarman : Jurnal Ilmiah Ilmu Komputer and when the article is accepted for publication. the authors transfer all and all rights into and to paper including but not limited to all copyrights in the Informatika Mulawarman. The author represents and warrants that the original is the original and that he/she is the author of this paper unless the material is clearly identified as the original source, with notification of the permission of the copyright owner if necessary. The author states that he has the authority and authority to make and carry out this task.
The author states that:
- This paper has not been published in the same form elsewhere.
- This will not be submitted elsewhere for publication prior to acceptance/rejection by this Journal.
A Copyright permission is obtained for material published elsewhere and who require permission for this reproduction. Furthermore, I / We hereby transfer the unlimited publication rights of the above paper to Informatika Mulawarman : Jurnal Ilmiah Ilmu Komputer. Copyright transfer includes exclusive rights to reproduce and distribute articles, including reprints, translations, photographic reproductions, microforms, electronic forms (offline, online), or other similar reproductions.
The author's mark is appropriate for and accepts responsibility for releasing this material on behalf of any and all coauthor. This Agreement shall be signed by at least one author who has obtained the consent of the co-author (s) if applicable. After the submission of this agreement is signed by the author concerned, the amendment of the author or in the order of the author listed shall not be accepted.
Rights / Terms and Conditions Saved
- The author keeps all proprietary rights in every process, procedure, or article creation described in Work.
- The author may reproduce or permit others to reproduce the work or derivative works for the author's personal use or for the use of the company, provided that the source and the Informatika Mulawarman copyright notice are indicated, the copy is not used in any way implying the Journal of Informatika Mulawarman (JIM) approval of the product or service from any company, and the copy itself is not offered for sale.
- Although authors are permitted to reuse all or part of the Works in other works, this does not include granting third-party requests to reprint, republish, or other types of reuse.
Informatika Mulawarman by http://e-journals.unmul.ac.id/index.php/JIM/index is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
under the CC BY-SA license, authors and other users are able to reprint, distribute or use the material for commercial purposes so long as they give attribution to the journal Informatika Mulawarman and license the republished material under the same license.
