UMM Institutional Repository

ANALISA PERBANDINGAN ALGORITMA A* SEARCH DAN DIJSKTRA UNTUK DISCOVERY FAIL PATH PADA ARSITEKTUR SOFTWARE DEFINED NETWORK (SDN)

Kelvianto, Luthfan Fajar (2019) ANALISA PERBANDINGAN ALGORITMA A* SEARCH DAN DIJSKTRA UNTUK DISCOVERY FAIL PATH PADA ARSITEKTUR SOFTWARE DEFINED NETWORK (SDN). Undergraduate (S1) thesis, University of Muhammadiyah Malang.

[img] Text
PENDAHULUAN.pdf
Restricted to Registered users only

Download (1MB)
[img] Text
BAB I.pdf
Restricted to Registered users only

Download (194kB)
[img] Text
BAB II.pdf
Restricted to Registered users only

Download (660kB)
[img] Text
BAB III.pdf
Restricted to Registered users only

Download (569kB)
[img] Text
BAB IV.pdf
Restricted to Registered users only

Download (460kB)
[img] Text
BAB V.pdf
Restricted to Registered users only

Download (206kB)
[img] Image
POSTER.jpg
Restricted to Registered users only

Download (8MB)

Abstract

Software Defined Network (SDN) is a network model that separates the control plane and data plane that connected using the Openflow protocol communication standard. SDN began to be developed in the last few years and has been widely implemented, one of which is for network routing. There are two routing algorithms in this study, A * Search and Dijkstra. Both of these algorithms will be implemented using the Mininet emulator and the Ryu controller. Tests carried out include throughput, jitter and latency parameters. In throughput testing, both algorithms do not have significant differences. At A * Search it has a throughput average of around 77 - 84 Mbps while Dijkstra has an average of around 76 - 84 Mbps. For the test results from jitter, A * Search is more stable with an average of 0.00460 / s to 0.005249 / s than the djikstra algorithm that gets an average value of 0.004735 / s to 0.005534 / s. And the result of latency testing, Dijkstra have better result with an average value of 3.296686 than the A * Search algorithm that gets an average value of 3.317816.

Item Type: Thesis (Undergraduate (S1))
Student ID: 201310370311281
Keywords: SDN, OpenFlow, Mininet, Ryu, A* Search, Dijkstra
Subjects: Z Bibliography. Library Science. Information Resources > ZA Information resources
Divisions: Faculty of Engineering > Department of Informatics (55201)
Depositing User: Sulistyaningsih Sulistyaningsih
Date Deposited: 26 Jun 2019 10:17
Last Modified: 11 Jan 2020 09:24
URI : http://eprints.umm.ac.id/id/eprint/46662

Actions (login required)

View Item View Item
UMM Official

© 2008 UMM Library. All Rights Reserved.
Jl. Raya Tlogomas No 246 Malang East Java Indonesia - Phone +62341464318 ext. 150, 151 - Fax +62341464101
E-Mail : infopus[at]umm.ac.id - Website : http://lib.umm.ac.id - Online Catalog : http://laser.umm.ac.id - Repository : http://eprints.umm.ac.id

Web Analytics

UMM Institutional Repository is powered by :
EPrints Logo