ANALISIS JARINGAN DENGAN ROUTING PROTOKOL BERBASIS SPF (SHORTEST PATH FIRST) DJIKSTRA ALGORITHM
Abstract
Full Text:
PDFReferences
] Edi, Doro. 2009. Kajian Algoritma Routing dalam Jaringan Komputer. Universitas Kristen Maranatha. Bandung
] Handaka, Michell Setyawati. 2010. Perbandingan Algoritma Dijkstra (Greedy), Bellman-Ford (BFS-DFS), dan Floyd-Warshall (Dynamic Programming) dalam Pengaplikasian Lintasan Terpendek pada Link-State Routing Protocol. Institut Teknologi Bandung
] http://id.wikipedia.org/wiki/Algoritmaijkstr
] Mohammed H. Sqalli, Sadiq M. Sait, and Syed A. 2011, OSPF Weight Setting Optimization For Single Link Failures, International Journal of Computer Networks & Communications (IJCNC) Vol.3, No.1, Dhahran, Saudi Arabia.
] Rendra Twidjojo, 2002, Konsep & implementasi routing dengan router miktorik 100 % connected, jasakom
Refbacks
- There are currently no refbacks.
Copyright (c) 2017 Oris Krianto Sulaiman, Khairuddin Nasution
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Buletin Utama Teknik
Fakultas Teknik - Universitas Islam Sumatera Utara
Jl. Sisingamangaraja, Teladan, Medan 20217
Website: https://jurnal.uisu.ac.id/index.php/but
Email: bultek@ft.uisu.ac.id
Buletin Utama Teknik is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License