Analisis EIGRP Metric Dalam Penentuan Jalur Terbaik Pada Jaringan
|
Abstract
In managing a large network, it takes the ability to manage the network so that traffic is good. To connect to such a large network requires many routers, each router will connect to one another. But the best choice of any router is required for network traffic efficiency. There are two routing protocols that can be used, namely static routing and dynamic routing. EIGRP is dynamic routing which, principally between routers, can communicate directly and dynamically, so that when there is a new router in a network, routers can communicate directly because they can exchange information. EIGRP uses the Diffussing Update Algorithm (DUAL) in determining the best path. In this study, EIGRP metrics will be analyzed to try the best path on the network by sending Internet Control Message Protocol (ICMP) packets. There are two networks that will be tested with differences in the Fast Ethernet bandwidth interface of each router. This experiment resulted in different values between Fast Ethernet default bandwidth and non-default bandwidth, so that the value of the variable affects the selection of the best path of network traffic
Keywords
Full Text:
PDFArticle Metrics
Abstract view : 153 timesPDF - 203 times
References
T. Dali Purwanto, “Analisis Kinerja Dynamic Routing pada Protokol Routing EIGRP untuk Menentukan Jalur Terbaik dengan Diffusing Update Algorithm (DUAL) (Dynamic Routing Performance Analysis on the EIGRP Routing Protokol to Determine the Best Path Using Diffusing Update Algo,” Juita, vol. VI, no. 2, pp. 89–97, 2018.
M. Rizal and S. U. Masruroh, “Valuasi Kinerja Jaringan DMVPN Menggunakan Routing Protocol RIPV2, OSPF, EIGRP dengan BGP,” JISKa (Jurnal Informatika Sunan Kalijaga), vol. 2, no. 3, pp. 143–150, 2018.
O. K. Sulaiman, 13 Lab Cisco Packet Tracer: Routing and Switching. Yogyakarta: Deepublish, 2018.
G. A. Loka, “Analisa dan Perbandingan Kinerja Routing Protocol OSPF dan EIGRP dalam Simulasi GNS3,” JISA(Jurnal Informatika dan Sains), vol. 1, no. 2, pp. 37–41, 2019, doi: 10.31326/jisa.v1i2.300.
O. K. Sulaiman, A. M. Siregar, K. Nasution, and T. Haramaini, “Bellman Ford algorithm - In Routing Information Protocol (RIP),” Journal of Physics: Conference Series, vol. 1007, no. 1, 2018, doi: 10.1088/1742-6596/1007/1/012009.
E. Muliandri, P. H. Trisnawan, and K. Amron, “Analisis Perbandingan Kinerja Routing Protokol IS-IS dengan Routing Protokol EIGRP dalam Dynamic Routing,” Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer (J-PTIIK) Universitas Brawijaya, vol. 3, no. 2, pp. 9221–9228, 2019.
P. Pramawahyudi, R. Syahputra, and A. Ridwan, “Evaluasi Kinerja First Hop Redundancy Protocols untuk Topologi Star di Routing EIGRP,” ELKOMIKA: Jurnal Teknik Energi Elektrik, Teknik Telekomunikasi, & Teknik Elektronika, vol. 8, no. 3, p. 627, 2020, doi: 10.26760/elkomika.v8i3.627.
A. Rahman and H. Nurwasito, “Analisis Kinerja Protokol Routing Is-Is Dan Protokol Routing Eigrp Pada Jaringan Topologi Mesh,” Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer, vol. 4, no. 11, pp. 4139–4147, 2020.
A. R. Wibowo, A. Anton, and P. Astuti, “the Application of Routing of Ospf and Eigrp Using the Method Redistribute To Improve the Efficiency of the Network,” Jurnal Riset Informatika, vol. 2, no. 4, pp. 219–226, 2020, doi: 10.34288/jri.v2i4.158.
A. Syukur and L. Julianti, “Simulasi Pemanfaatan Dynamic Routing Protocol EIGRP Pada Router di Jaringan Universitasi Islam Riau Beserta Autentikasinya,” Jurnal Teknologi Informasi dan Ilmu Komputer, vol. 5, no. 1, p. 23, 2018, doi: 10.25126/jtiik.201851535.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Analisis EIGRP Metric Dalam Penentuan Jalur Terbaik Pada Jaringan
Refbacks
- There are currently no refbacks.
Copyright (c) 2021 JURIKOM (Jurnal Riset Komputer)

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
JURIKOM (Jurnal Riset Komputer)
Di publikasikan oleh P3M - STMIK BUDI DARMA
Email: jurikom.stmikbd@gmail.com
Ciptaan disebarluaskan di bawah Lisensi Creative Commons Attribution 4.0 International.