EIGRP Routing Performance Analysis with Simulated Shortest Path Selection Using Dijkstra Algorithm

Teresa Martuah Purba; Angela Steffani Sitanggang; Suriaty Padang; Anastasya Jesica Sidauruk; Elsahday Tambunan

doi:10.59934/jaiea.v5i1.1244

Authors

Teresa Martuah Purba Santo Thomas Catholic University
Angela Steffani Sitanggang Santo Thomas Catholic University
Suriaty Padang Santo Thomas Catholic University
Anastasya Jesica Sidauruk Santo Thomas Catholic University
Elsahday Tambunan Santo Thomas Catholic University

DOI:

https://doi.org/10.59934/jaiea.v5i1.1244

Keywords:

Routing, EIGRP, Dijkstra Algorithm, Shortest Path

Abstract

This study aims to analyze the performance of the Enhanced Interior Gateway Routing Protocol (EIGRP) in selecting the best path and compare it with the shortest path generated by the Dijkstra algorithm through network simulation. EIGRP is a dynamic routing protocol that uses composite metrics such as bandwidth and delay, whereas Dijkstra calculates the shortest path based on the minimum total weight in a network topology. This research employs a literature review supported by simulations conducted using [insert software name]. The results indicate that EIGRP outperforms in terms of convergence speed and adaptability to topology changes, while Dijkstra produces more optimal paths in terms of delay and hop count. The findings suggest that combining both approaches may enhance routing efficiency and provide a foundation for developing more adaptive and intelligent network systems.

Downloads

Download data is not yet available.

References

K. Finata and K. Nasution, “Analisis Kinerja Protokol Routing Open Shortest Path First (OSPF) pada Jaringan Universitas Islam Sumatera Utara,” sudo J. Tek. Inform., vol. 3, no. 2, pp. 76–89, 2024, doi: 10.56211/sudo.v3i2.532.

Rizki Indra Saputra, “Analisis Kinerja Redistribution Routing Protokol OSPF, EIGRP dan BGP,” pp. 1–115, 2021.

M. A. MF, “ANALISIS KINERJA PROTOKOL OSPF DAN RIPv2MENGGUNAKAN ONOS CONTROLLER PADA JARINGANSOFTWARE DEFINED NETWORKS (SDN),” 2024.

B. Ulummudin and M. Suartana, “Mengatasi Link Failure Pada Software Defined Network Dengan Routing Ulang Menggunakan Algoritma Dijkstra,” J. Informatics Comput. Sci., vol. 03, pp. 193–199, 2021.

G. Purnama, “Studi Kinerja Protokol Routing Dinamis Ospf Menggunakan Simulator Opnet,” J. Inform. dan Tek. Elektro Terap., vol. 11, no. 3s1, pp. 990–996, 2023, doi: 10.23960/jitet.v11i3s1.3431.

S. Binti Dona, D. M. Wiharta, and N. Indra ER, “Analisis Kinerja Protokol Routing Dinamis Is-Is Untuk Meningkatkan Performansi Jaringan Hybrid Kampus Unud Denpasar,” J. SPEKTRUM, vol. 10, no. 4, p. 348, 2023, doi: 10.24843/spektrum.2023.v10.i04.p40.

S. Arifin, “Kinerja dmvpn phase 3 dan mpls l3 vpn dengan routing protocol ospfv2, eigrp, bgpv4 dan ipsec terhadap layanan video streaming menggunakan gns3,” Repository.Uinjkt.Ac.Id, 2024, [Online]. Available: https://repository.uinjkt.ac.id/dspace/handle/123456789/77068%0Ahttps://repository.uinjkt.ac.id/dspace/bitstream/123456789/77068/1/SAMSUL ARIFIN-FST.pdf

N. Iryani, A. D. Ramadhani, and M. K. Sari, “Analisis Performansi Routing OSPF menggunakan RYU Controller dan POX Controller pada Software Defined Networking,” J. Telekomun. dan Komput., vol. 11, no. 1, p. 73, 2021, doi: 10.22441/incomtech.v11i1.10187.