PENENTUAN JALUR TERPENDEK MENGGUNAKAN ALGORITMA BELLMAN-FORD PADA SOFTWARE DEFINED NETWORK

FEPILIANA, FEPILIANA and Stiawan, Deris and Heryanto, Ahmad (2018) PENENTUAN JALUR TERPENDEK MENGGUNAKAN ALGORITMA BELLMAN-FORD PADA SOFTWARE DEFINED NETWORK. Undergraduate thesis, Sriwijaya University.

[thumbnail of RAMA_56201_09011181320024.pdf] Text
RAMA_56201_09011181320024.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (6MB) | Request a copy
[thumbnail of RAMA_56201_09011181320024_0003047905_0022018703_01_front_ref.pdf]
Preview
Text
RAMA_56201_09011181320024_0003047905_0022018703_01_front_ref.pdf - Accepted Version
Available under License Creative Commons Public Domain Dedication.

Download (1MB) | Preview
[thumbnail of RAMA_56201_09011181320024_0003047905_0022018703_02.pdf] Text
RAMA_56201_09011181320024_0003047905_0022018703_02.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (898kB) | Request a copy
[thumbnail of RAMA_56201_09011181320024_0003047905_0022018703_03.pdf] Text
RAMA_56201_09011181320024_0003047905_0022018703_03.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (1MB) | Request a copy
[thumbnail of RAMA_56201_09011181320024_0003047905_0022018703_04.pdf] Text
RAMA_56201_09011181320024_0003047905_0022018703_04.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (1MB) | Request a copy
[thumbnail of RAMA_56201_09011181320024_0003047905_0022018703_05.pdf] Text
RAMA_56201_09011181320024_0003047905_0022018703_05.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (12kB) | Request a copy
[thumbnail of RAMA_56201_09011181320024_0003047905_0022018703_06_ref.pdf] Text
RAMA_56201_09011181320024_0003047905_0022018703_06_ref.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (338kB) | Request a copy
[thumbnail of RAMA_56201_09011181320024_0003047905_0022018703_07_ref.pdf] Text
RAMA_56201_09011181320024_0003047905_0022018703_07_ref.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (235kB) | Request a copy

Abstract

Software Defined Network (SDN) is a network architecture which separates control plane and data plane. Focus of this research is discusses Bellman-Ford algorithm in determining the shortest path, as well as a QoS single topology and custom topology using parameters throughput, delay, packet loss refers to standardization ITU-T G.1010. Bellman-Ford algorithm is implemented on a POX controller and tested in a custom topology. Scenario is source host sends packet to destination host using PING command, then when packet delivery is in progress a traffic engineering link failure is made such as link down. Based on tests that have been done, it can be concluded that Bellman-Ford algorithm applied in custom topology SDN network is able to find other shortest paths as alternative paths based on number of hops shortest between switches. For QoS results in a single topology, throughput smallest TCP 720 Kbps and largest TCP 758 Kbps, while smallest UDP 695 Kbps and largest UDP 729 Kbps. Delay value single topology smallest TCP 0,00670 s and largest TCP 0,00705 s, while smallest UDP 0,01142 s and largest UDP 0,01199 s. Packet loss value single topology smallest TCP 0% and largest TCP 0,00383%, while smallest UDP 0% and largest UDP 0,01596%. In custom topology, throughput smallest TCP 431 Kbps and largest TCP 497 Kbps, while smallest UDP 413 Kbps and largest UDP 460 Kbps. Delay value smallest TCP 0,01016 s and largest TCP 0,01168 s, while smallest UDP 0,01690 s and largest UDP 0,02015 s. Packet loss value smallest TCP 0,00052% and largest TCP 0,02363%, while smallest UDP 0% and largest UDP 0,06445%. Based on results of QoS tests that have been obtained, it can be concluded that a SDN network single topology and custom topology has good QoS performance which refers to standardization ITU-T G.1010.

Item Type: Thesis (Undergraduate)
Uncontrolled Keywords: SDN, Jalur Terpendek, Algoritma Bellman-Ford, QoS
Subjects: T Technology > T Technology (General) > T58.4 Managerial control systems Information technology. Information systems (General)
Divisions: 09-Faculty of Computer Science > 56201-Computer Systems (S1)
Depositing User: Mr Halim Sobri
Date Deposited: 24 Sep 2019 03:22
Last Modified: 24 Sep 2019 03:22
URI: http://repository.unsri.ac.id/id/eprint/8653

Actions (login required)

View Item View Item