ROUTING OPTIMIZATION ON SOFTWARE DEFINED NETWORK ARCHITECTURE USING BREADTH FIRST SEARCH ALGORITHM

David Armanda; Fransiska Sisilia Mukti; Danang Arbian  Sulistyo

doi:10.52436/1.jutif.2024.5.4.2000

David Armanda Informatics Engineering, Faculty of Technology and Design, Asia Institut of Technology and Business Malang, Indonesia
Fransiska Sisilia Mukti Informatics Engineering, Faculty of Technology and Design, Asia Institut of Technology and Business Malang, Indonesia
Danang Arbian Sulistyo Informatics Engineering, Faculty of Technology and Design, Asia Institut of Technology and Business Malang, Indonesia

DOI: https://doi.org/10.52436/1.jutif.2024.5.4.2000

Keywords: BFS modification, Conventional BFS, QoS, routing, SDN

Abstract

Software Defined Network (SDN) is a network modelling that separates the control plane and data plane. SDN is a new form of paradigm used for large-scale networks, one of which is for routing. Most types of routing used today use single-path routing. Single-path only uses one path as data transmission. This will result in reduced performance on the network which is often referred to as network congestion. In this test, the routing algorithm used is Breadth First Search (BFS) by modifying the path so that congestion on the network can be minimised. The BFS algorithm is implemented using Mininet emulator, Ryu Controller, and fat-tree topology. In the test, 20 scenarios were used with a bandwidth of 50 - 1000 Mbps within 15 seconds. Tests were conducted to measure the performance of the BFS algorithm, namely the path and QOS (Quality Of Service) parameters which include testing delay, packet loss, jitter, and throughput. The data obtained in testing using the conventional BFS algorithm is compared with the modified BFS algorithm data in the same test method. In path testing, the modified BFS algorithm is superior and in parameter testing, it is produced with a degraded percentage value in delay (65%), packet loss (99%), jitter (84%), and throughput has increased by (41%). So the modified BFS algorithm is superior due to the utilisation of path modification for routing optimisation which is more effective in handling network congestion.

Downloads

Download data is not yet available.

References

M. M. Ridhoilah, A. Basuki, and K. Amron, “Penggunaan Jalur dalam Multipath Routing secara Proporsional Berdasarkan Kebutuhan Bandwidth Pengguna pada Software Defined Networking,” 2020. [Online]. Available: http://j-ptiik.ub.ac.id

D. A. Mutiara, K. N. Isnaini, and D. Suhartono, “Network Programmability for Network Issue Using Paramiko Library,” J. Tek. Inform., vol. 4, no. 4, pp. 751–758, 2023, doi: 10.52436/1.jutif.2023.4.4.691.

A. Shafira, S. N. Hertiana, and L. V. Yovita, “Analisis Performansi Integrasi Sistem Named Data Networking Dan Software Defined Network Untuk Komunikasi Data,” vol. 1, no. 1, pp. 28–35, 2023, doi: https://doi.org/10.25124/jnst.v1i1.6727.

D. Krisyanto, R. A. Siregar, and K. Amron, “Pencarian Jalur Alternatif berbasis Algoritme Yen’s pada Jaringan Software Defined Network,” vol. 6, no. 3, pp. 1165–1174, 2022, [Online]. Available: http://j-ptiik.ub.ac.id

I. P. A. E. Pratama and K. C. Bakkara, “Pengujian QoS Pada Implementasi SDN Berbasis Mininet dan OpenDaylight Menggunakan Topologi Tree,” J. Sisfokom (Sistem Inf. dan Komputer), vol. 10, no. 2, pp. 170–175, 2021, doi: 10.32736/sisfokom.v10i2.1141.

M. Khatami, “Studi ; Performansi ; Protokol Routing ; IS- IS ; Pada Arsitektur Jaringan ; Software ; Defined ; Network ;( SDN ),” vol. 10, no. 2, 2023.

F. Nisa and S. Ramadona, “Sistem Pencegahan Serangan Distributed Denial Of Service Pada Jaringan SDN,” J. Sistim Inf. dan Teknol., vol. 5, no. 3, pp. 1–8, 2023, doi: 10.60083/jsisfotek.v5i3.269.

I. Arthalia Wulandari and P. Sukmasetyan, “Implementasi Algoritma Dijkstra untuk Menentukan Rute Terpendek Menuju Pelayanan Kesehatan,” J. Ilm. Sist. Inf., vol. 1, no. 1, pp. 30–37, 2022, doi: 10.24127/jisi.v1i1.1953.

A. K. Sriastunti, R. Primananda, and W. Yahya, “Implementasi Routing pada OpenFlow Software-Defined Network dengan Algoritme Depth-First Search dan Breadth-First Search,” J. Pengemb. Teknol. Inf. dan Ilmu Komput., vol. 3, no. 8, pp. 8112–8120, 2019.

Y. S. Putra, M. T. Indriastuti, and F. S. Mukti, “OPTIMALISASI NILAI THROUGHPUT JARINGAN LABORATORIUM MENGGUNAKAN METODE HIERARCHICAL TOKEN BUCKET (STUDI KASUS: STMIK ASIA MALANG),” Netw. Eng. Res. Oper., vol. 5, no. 2, p. 83, Oct. 2020, doi: 10.21107/nero.v5i2.161.

R. Zuhdianto and F. S. Mukti, “a Clustering Optimization for Energy Efficiency in Wireless Sensor Network Using K-Means Algorithm,” J. Tek. Inform., vol. 4, no. 1, pp. 225–234, 2023, doi: 10.52436/1.jutif.2023.4.1.523.

S. Shidqi, D. A. Sulistyo, and F. A. Ahda, “Pembuatan Infrastruktur Database Menggunakan Metode Replikasi Untuk Pelanggan Jagoan Hosting,” J. Ilm. Teknol. Inf. Asia, vol. 16, no. 1, p. 65, 2022, doi: 10.32815/jitika.v16i1.702.

Siddik.mohd, “ANALISIS QUALITY OF SERVICE JARINGAN LOCAL AREA NETWORK MENGGUNAKAN MIKROTIK ROUTERBOARD750 Mohd . Siddik Program Studi Sistem Informasi , STMIK Royal Kisaran email : mohdsiddik27@gmail.com PENDAHULUAN Saat ini penggunaan Jaringan komputer bukan lagi meru,” J. Teknol. dan Sist. Inf., vol. V, no. 2, pp. 113–118, 2019.

I. N. Khoerotunisa, S. N. Hertiana, and R. M. Negara, “Analysis of User Mobility Performance on Software Defined Wireless Network Using Dijkstra Algorithm,” J. Tek. Inform., vol. 2, no. 2, pp. 127–133, 2021, doi: 10.20884/1.jutif.2021.2.2.84.

U. B. Hanafi, M. A. D. Arie, M. R. Fikri, and T. Irfan, “Analisis perbandingan algoritma Dijkstra dan Breadth First Search pada packet forwarding arsitektur SDN,” JITEL (Jurnal Ilm. Telekomun. Elektron. dan List. Tenaga), vol. 2, no. 1, pp. 57–66, Mar. 2022, doi: 10.35313/jitel.v2.i1.2022.57-66.

V. Gueant, “iPerf - The TCP, UDP and SCTP network bandwidth measurement tool.” 2023.

A. Pramudita, “Implementation of Load Balancing With Per Connection Classifier and Failover and Utilization of Telegram Bot ( Case Study : Pt Tujuh Media Angkasa ) Implementasi Load Balancing Dengan Per Connection Classifier Dan Failover Serta Pemanfaatan Bot Telegram (,” vol. 5, no. 1, pp. 273–282, 2024.

I. Suryo Wicaksono and P. Hari Trisnawan, “Implementasi Multipath Routing menggunakan Algoritme Iterative Deepening Depth First Search pada OpenFlow Software-Defined Networking,” 2021. [Online]. Available: http://j-ptiik.ub.ac.id

A. Turmudi and F. Abdul Majid, “Analisis QoS (Quality Of Service) Dengan Metode Traffi Shaping Pada jaringan Interent ( Studi Kasus : PT Toyonaga Indonesia),” Sigma, vol. 9, no. 4, pp. 2407–3903, 2019, [Online]. Available: https://jurnal.pelitabangsa.ac.id/index.php/sigma/article/view/445

A. Z. Firmansah and A. Hadi, “KOMPARASI LOAD BALANCING METODE PCC DAN NTH PADA MIKROTIK IMPLENTASI DI AL IRSYAD TENGARAN 7 BATU,” JIPI (Jurnal Ilm. Penelit. dan Pembelajaran Inform., vol. 8, no. 1, pp. 21–26, Feb. 2023, doi: 10.29100/jipi.v8i1.3261.

ETSI, “Telecommunications and Internet Protocol Harmonization Over Networks (TIPHON); General aspects of Quality of Service (QoS),” Etsi Tr 101 329 V2.1.1, vol. 1, pp. 1–37, 2020.