Analisis Perbandingan Kinerja Algoritma Floyd-Warshall, Bellman-Ford, Dan Dijkstra Pada Software Defined Network

Adhyasta, Veda (2024) Analisis Perbandingan Kinerja Algoritma Floyd-Warshall, Bellman-Ford, Dan Dijkstra Pada Software Defined Network. Other thesis, Institut Teknologi Sepuluh Nopember.

Text 5022201076-Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only until 1 October 2026. Download (3MB) | Request a copy

Abstract

Software Defined Network (SDN) adalah paradigma jaringan yang memisahkan kontrol jaringan (control plane) dari perangkat keras jaringan (data plane) sehingga memungkinkan pengelola jaringan untuk mengontrol dan mengatur lalu lintas jaringan secara terpusat dan dinamis melalui perangkat lunak. Perbedaan utama antara SDN dan jaringan konvensional adalah dalam cara kontrol lalu lintas jaringan diatur. Pada jaringan konvensional, kontrol dan forwarding dilakukan secara terpadu di dalam perangkat keras jaringan, sedangkan dalam SDN, kontrol lalu lintas dipisahkan dari perangkat keras jaringan dan diatur secara terpusat melalui perangkat lunak. Hal ini yang membuat control plane pada SDN bersifat programmable sehingga memungkinkan untuk menerapkan berbagai aplikasi jaringan, salah satunya pada proses routing. Beberapa algoritma routing bisa diimplementasikan pada proses routing. Algoritma routing yang digunakan pada penelitian ini ada 3, yaitu Algoritma Floyd-Warshall, Algoritma Dijkstra, dan Algoritma Bellman-Ford. Ketiga algoritma dapat dimanfaatkan untuk menentukan rute terpendek dari sumber hingga tujuan pada proses routing.
=================================================================================================================================
Software Defined Networking (SDN) is a network paradigm that separates the network control (control plane) from the network hardware (data plane), enabling network administrators to centrally and dynamically control and manage network traffic through software. The main difference between SDN and conventional networks lies in how network traffic control is organized. In conventional networks, control and forwarding are integrated within the network hardware, while in SDN, traffic control is separated from the network hardware and centrally managed through software. This makes the control plane in SDN programmable, allowing for the implementation of various network applications, including routing processes. Some of routing algorithm can implemented on the routing processes. The routing algorithms used in this study are the Floyd-Warshall Algorithm, the Dijkstra Algorithm, and the Bellman-Ford Algorithm. Those algorithms can be utilized to determine shortest path from a source to a destination in the routing process.

Item Type:	Thesis (Other)
Uncontrolled Keywords:	Algoritma Dijkstra, Algoritma Bellman-Ford, Algoritma Floyd-Warshall, Software Defined Network, Bellman-Ford Algorithm, Dijkstra Algorithm, Floyd-Warshall Algorithm.
Subjects:	T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK5105.543 Routers (Computer networks)
Divisions:	Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Electrical Engineering > 20201-(S1) Undergraduate Thesis
Depositing User:	Veda Adhyasta
Date Deposited:	29 Jul 2024 07:56
Last Modified:	29 Jul 2024 07:56
URI:	http://repository.its.ac.id/id/eprint/109852

Actions (login required)

View Item