Implementasi Jaringan Failover Menggunakan OSPF Dengan Algoritme Djikstra
Abstract
Companies usually implement OSPF (Open Shortest Path First) routing on a single link as a communication path to the Internet. This is very vulnerable when there is a problem with the link. The problem that is often encountered is when the link is down. To keep the internet connection running, it is necessary to further develop the network communication process by implementing failover. Failover utilizes two links, the first as the main link and the second link as a backup. This paper will simulate the implementation of a failover network using OSPF in the EVE-NG simulation. The results when testing OSPF use the cost value to determine the link selection. The link with the lowest cost value will be used as the main line, while the link with the higher cost value is used as the backup line. When the main connection is interrupted, the connection will switch to the backup. The ping results obtained in the test when the line changed were 21ms; and it only happened two times unreachable, while for browsing traffic there were no problems on the network.
Keywords: Internet; failover network; Open Shortest Path First; Djikstra's Algorithm
Abstrak
Perusahaan biasanya mengimplementaskan routing OSPF (Open Shortest Path First) pada satu single link sebagai jalur komunikasi ke Internet. Hal ini sangat rentan ketika terjadi permasalahan pada link. pPermasalahan yang sering ditemui adalah ketika link down. Untuk menjaga koneksi internet agar tetap berjalan perlu adanya pengembangan lebih lanjut pada proses komunikasi jaringan dengan menerapkan failover. Failover memanfaatkan dua buah link, pertama sebagai main link dan link kedua sebagai backup. Paper ini akan mensimulasikan implementasi jaringan failover menggunakan OSPF pada simulasi EVE-NG. Hasilnya pada saat pengujian OSPF menggunakan nilai cost untuk menentukan pemilihan linknya. Link dengan nilai cost terkecil akan digunakan sebagai jalur utama, sedangkan link dengan nilai cost yang lebih tinggi digunakan sebagai jalur backup. Ketika koneksi utama terganggu maka koneksi akan berpindah ke backup. Hasil ping yang didapat dalam uji coba ketika jalur berpindah adalah 21ms; dan hanya terjadi dua kali unreachable, sedangkan untuk trafik browsing tidak mengalami kendala pada jaringan.
Keywords: Internet; Jaringan failover; Open Shortest Path First; Algoritme Djikstra
References
R. Gatra and B. Sugiantoro, “Analysis of Backbone UIN Sunan Kalijaga Network Development in Yogyakarta Using Comparison of Static Routing Protocol and OSPF Dynamic Routing,” Proc. Int. Conf. Sci. Eng. (ICSE-UIN-SUKA 2021), vol. 211, pp. 130–137, 2022, doi: 10.2991/aer.k.211222.021.
O. K. Sulaiman, “Analisis Perbandingan Penggunaan Metric Cost dan Bandwidth Pada Routing Protocol OSPF,” Sink. J. dan Penelit. Tek. Inform., vol. 1, no. April 2017, pp. 7–12, 2017, [Online]. Available: http://jurnal.polgan.ac.id/index.php/sinkron/article/view/28
H.A. Musril, “Penerapan Open Shortest Path First (Ospf) Untuk Menentukan Jalur Terbaik Dalam Jaringan”. Jurnal Elektro dan Telekomunikasi Terapan (e-Journal), vol. 4, no. 1, pp. 421-421, 2017.
A.S.C. Polii, “Simulasi Kinerja Waktu Konvergensi Protokol Routing Open Shortest Path First (OSPF) Pada Jaringan Kampus. Tesis, Program Pascasarjana Universitas Hasanuddin Makassar, 2013.
Khaing Khaing Wai, “Analysis of RIP, EIGRP, and OSPF Routing Protocols in a Network,” Int. J. Trend Sci. Res. Dev., vol. 3, no. 5, pp. 2484–2487, 2019, doi: https://doi.org/ 10.31142/Dijtsrd27928.
I. Nurhaida, D. Ramayanti, and I. Nur, “Performance Comparison based on Open Shortest Path First (OSPF) Routing Algorithm for IP Internet Networks,” Commun. Appl. Electron., vol. 7, no. 31, pp. 12–25, 2019, doi: 10.5120/cae2019652838.
A. Najim, R. Sami, and S. Abbas, “Performance Evaluation of Common Routing Protocols RIP , OSPF , IGRP Evaluación de rendimiento de protocolos de,” Rev. Aus 25, no. August, pp. 106–112, 2019, doi: 10.4206/aus.2019.n25.9.
M. H. Kabir, M. A. Kabir, M. S. Islam, M. G. Mortuza, and M. Mohiuddin, “Performance Analysis of Mesh Based Enterprise Network Using RIP, EIGRP and OSPF Routing Protocols,” Eng. Proc., no. November, p. 47, 2022, doi: 10.3390/ecsa-8-11285.
M. Handika, H. Herwin, D. Haryono, and R. Muzawi, “Implementation of Dynamic Routing With Ospf (Open Shortest Path First) Technique in Local Area Network (Lan) At Smkn 2 Teluk Kuantan,” J. Teknol. Dan Open Source, vol. 4, no. 1, pp. 65–70, 2021, doi: 10.36378/jtos.v4i1.1382.
R. D. Marcus, E. P. Wibowo, and M. Muksin, “Penerapan Open Shortest Path Fisrt (OSPF) untuk Membangun Jaringan Berskala Besar Berbasis Mikrotik,” Briliant J. Ris. dan Konseptual, vol. 3, no. 3, p. 319, 2018, doi: 10.28926/briliant.v3i3.204.
E. G. W. P. S. D. Krisnaningsih, “Penerapan Ospf Routing, De-Militarized Zone, Dan Firewall Pada Mikrotik Routerboardtm Dinas Komunikasi Dan Informatika Depok,” J. Sist. Inf., vol. Volume.2, J. Sist. Inf., pp. 59–67, 2015, [Online]. Available: http://hdl.handle.net/ 11311/551109
N. Hayati and R. T. K. Sari, “Configuration and Analysis Link-State Open Shortest Path First Routing Performance Multi-Area,” SMARTICS J., vol. 7, no. 1, pp. 14–20, 2021.
A. P. N. Permana and R. Firmansyah, “Distribusi Jaringan Menggunakan Routing Ospf Dengan Metode Redistribution,” Simetris J. Tek. Mesin, Elektro dan Ilmu Komput., vol. 9, no. 1, pp. 519–532, 2018, doi: 10.24176/simet.v9i1.2030.
D. I. Mudhoep, Linawati, and Oka Saputra, “Kombinasi Protokol Routing OSPF dan BGP dengan VRRP, HSRP, dan GLBP,” J. Nas. Tek. Elektro dan Teknol. Inf., vol. 10, no. 1, pp. 1–10, 2021, doi: 10.22146/jnteti.v10i1.942.
Y. Jiang, P. Guo, and M. Guo, “A Network Topology Discovery Model Based on OSPF,” Atl. Press, vol. 3, no. Jimec 2018, pp. 283–286, 2018, doi: 10.2991/jimec-18.2018.60.
H. Nurwarsito and A. R. Sindunata, “Optimization of hello interval in OSPF routing protocol performance on mesh network topology,” EECCIS 2020 - 2020 10th Electr. Power, Electron. Commun. Control. Informatics Semin., pp. 222–225, 2020, doi: 10.1109/EECCIS49483.2020.9263434.
A. Triwerdaya, D. Trianto Nugrahadi, M. I. Mazdadi, I. Budiman, and A. R. Arrahimi, “Journal of Data Science and Software Engineering Implementation of Load Balance ECMP Between BGP and OSPF Using Dual Connection (Aji) | 110 Implementation Of Load Balance Equal Cost Multi Path (Ecmp) Between Routing Protocol Border Gateway Protocol (BGP),” J. Data Sci. Softw. Eng., vol. 01, no. 2, pp. 110–118, 2020.
P. Perdana and D. V. S. Y. Sakti, “Implementasi Dynamic Routing OSPF dengan Metode Single Area Pada SMK Budi Mulia Tangerang,” J. IDEALIS, vol. 2, no. 1, pp. 407–414, 2019, [Online]. Available: http://jom.fti.budiluhur.ac.id/index.php/IDEALIS/article/view/ 1434/728
C. B. Waluyo, “Analisis kinerja Routing OSPF dan EIGRP dengan Teknik Redistribution,” Conf. Senat. STT Adisutjipto Yogyakarta, vol. 6, pp. 167–176, 2020, doi: 10.28989/senatik.v6i0.428.
How To Cite This :
Refbacks
- There are currently no refbacks.
