Configuration and Analysis Link-State Open Shortest Path First Routing Performance Multi-Area
DOI:
https://doi.org/10.21067/smartics.v7i1.5009Kata Kunci:
Dijkstra Algorithm, Link-State Algorithm, OSPF, Routing ProtocolAbstrak
Open Shortest Path First (OSPF) is a routing protocol that uses a link-state algorithm to build and calculate the best path to all known destinations. The link-state algorithm is also known as the Dijkstra algorithm or Shortest Path First (SPF) algorithm. The Dijkstra algorithm applied in the OSPF protocol to choose the best route. That a data packet must take from an origin address to arrive at the destination address with the least cost metric. The results showed that using the OSPF routing protocol between the Head Office and Branch can communicate with each other by sending each OSPF database to each router where the maximum data transmission value is 1-millisecond sending data successfully reaches100%
Referensi
D. Wiyoto, CCNA v127.1.1.3 Workbook. Tangerang: Best Path Training Center, 2017.
Achmad, “Implementasi Routing Protocol Open Shortest Path First (OSPF) Pada Model Topology Ring,†Fakt. Exacta, vol. 8, no. 2, pp. 92–99, 2015.
E. Adiman, I. Suprayogi, and Y. Handayani, “Analisa Perbandingan Kinerja Routing Ripv1 EIGRP dan OSPF Di PT. Chevron Pacific Indonesia,†J. Online Mhs. Fak. Tek. Univ. Riau, vol. 2, no. 1, pp. 1–13, 2015.
Iwan Sofana, Cisco CCNA & Jaringan Komputer. Bandung: Informatika, 2009.
G. Barovih, “Perbandingan Performa Software Router Pada Simulasi Routing OSPF Multi Area,†IT J., vol. 4, no. 2, pp. 181–191, 2016.
Unduhan
Diterbitkan
Cara Mengutip
Terbitan
Bagian
Lisensi
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
