Analisa Perbandingan Implementasi Algoritma Dijkstra dan Depth-first Search Pada Jaringan Software Defined Network
| Main Author: | Syarifuddin, Imam |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2019
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/54844/1/Pendahuluan.pdf http://eprints.umm.ac.id/54844/2/BAB%20I.pdf http://eprints.umm.ac.id/54844/3/BAB%20II.pdf http://eprints.umm.ac.id/54844/4/BAB%20III.pdf http://eprints.umm.ac.id/54844/5/BAB%20IV.pdf http://eprints.umm.ac.id/54844/6/BAB%20V.pdf http://eprints.umm.ac.id/54844/43/POSTER.pdf http://eprints.umm.ac.id/54844/ |
Daftar Isi:
- The existence of a new paradigm in the network to design to build and manage a computer network, this is a concept of Software Defined Network (SDN). The concept of changing complex architecture is simpler, where the control plane and the data plane are separate. One important component in SDN is routing, routing is useful for sending data from one node to another node so that information is more easily obtained. The role of routing here is very important to exchange data, therefore the performance of each routing algorithm needs to be tested, so that it can know the capabilities of the routing algorithm. In this study, a comparison of the Quality of Service (QoS) value analysis of SDN implementation was carried out using the Dijkstra algorithm with the Depth-first Search algorithm, which is run with a mesh topology of 4, 5, and 6 switches. The results obtained in the test are the Depth-first Search algorithm is more stable than the Dijkstra algorithm.