Claim Missing Document
Check
Articles

Found 5 Documents
Search

Implementasi Load Balancer Berdasarkan Server Status Pada Arsitektur Software Defined Network (SDN) Lalu Fani Islahul Ardy; Aditya Bhawiyuga; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 5 (2018): Mei 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (857.232 KB)

Abstract

One of the problems in computer network is load balancing. The emergence of Software Defined Network (SDN) architecture is expected to be a new paradigm in addressing issues related to load balancing on traditional networks. The flexibility gained from separation between control plane and data plane on the SDN architecture makes it feasible to develop technologies that hard to implement on traditional networks. In this research, a load balancing algorithm is developed based on the SDN architechture. An SDN controller that is connected to an SDN switch will sends messages to each server based on the specified time interval to get the CPU and memory utilization and response time from each server. Those parameters are used to determine the load of each server. The SDN switch will then split request from client to server with smallest load. Load balancing algorithm's performance will then be compared to similar algorithms on server clusters with same specification (homogeneous) and server clusters with different specifications (heterogeneous). The result found that the proposed algorithm is able to distribute requests from clients to servers based on status of the server and perform better than similar algorithms on server clusters with different spesifications (heterogeneous).
Implementasi Cross Site Scripting Vulnerability Assessment Tools berdasarkan OWASP Code Review Muhammad Isfa Hany; Aditya Bhawiyuga; Ari Kusyanti
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 9 (2021): September 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Cross site scripting (XSS) attacks is one of the most discovered vulnerabilities in the web application. Unfortunately, not all software engineer and security engineering team fluent aganist all of the web vulnerabilities (Khan et al., 2017). OWASP Code review is a written document explaining about principles, rules, and standards about web application source code analysis. Furthermore, vulnerability assessment process can also aid in more efficient web application vulnerability discoveries. This research will also build a system that can perform vulnerability assessment according to OWASP Code Review. In the system design phase, there are seven regular expression patterns that can help to identify security violation from the chunk of source code and two main regular expressions patterns to find vulnerabilities. Moreover, there are five algorithm design in order to understands how the system will be implemented. The system is implemented with Django Framework and have been tested based on validity, cpu usage, and response time. According to the test result, the system built is better than discovering cross site scripting
Implementasi Algoritma Dijkstra dengan Pembobotan Link Dinamis berdasarkan Packet Loss untuk Pencarian Rute Terpendek pada Software Defined Networking Julio Firdaus Irawan; Primantara Hari Trisnawan; Aditya Bhawiyuga
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 12 (2021): Desember 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

SDN is a new paradigm in computer networks that separates the control plane and data plane. The concept offers better programmability of devices and more efficient network management. In the context of determining the route in the routing mechanism on the SDN network, topology discovery and routing calculations are carried out by the SDN controller only. The mechanism in determining the best route traversed by a packet from the sender to the receiver is determined by a routing algorithm. One of the existing routing algorithms is the link-state routing algorithm. One application of the existing link state routing algorithm is the Dijkstra algorithm. In Dijkstra's Algorithm the focus of this algorithm is only on the route search strategy without defining the weights used. In general, the static distance between two nodes will be weighted without considering the condition factor of the network being passed. Weights based on distance will result in the shortest route but may not be the most optimal. With the programmable SDN technology, weight optimization that considers network density can be implemented. Therefore, in this research, the implementation of Dijkstra's routing algorithm system for finding the shortest path has been carried out by paying attention to packet loss as a weight. From the test results, the results obtained that the system has been able to search for paths by considering the smallest packet loss value on the link. In throughput testing, the system has significantly superior throughput compared to static Dijkstra algorithm. Then based on packet loss testing, this system has packet loss ranging from 0 - 1% compared to Dijkstra's static algorithm which has a significant increase in packet loss when the number of clients is more than 30. In this system the convergence time value obtained is not much different from the static Dijkstra algorithm.
Implementasi Routing Dinamis pada Wireless Sensor Network menggunakan Modul Komunikasi LoRa Mahardika Putra Utama; Dany Primanita Kartikasari; Aditya Bhawiyuga
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 12 (2021): Desember 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The development of the WSN (Wireless Sensor Network) concept on the Internet of Things allows communication to be carried out wirelessly so as to help node mobility. Nodes that can move freely to move away from the gateway can cause communication to be interrupted so that a relay is needed as an intermediary for data transmission. Other nodes can be used to become a relay that helps bridge data transmission between nodes and gateways and utilizes multihop communication. So that each relay is responsible for sending its own data and forwarding data to other nodes that are not in the range of the gateway. In addition, this multihop concept can increase the range of wireless communication modules by utilizing other nodes as relays. A node that is not directly connected to the gateway must be able to find a routing path to get to the gateway. The path chosen must be the shortest path, so we need a routing protocol that can collect existing network information and choose the shortest path to get to the gateway. The routing protocol that is created must also be dynamic so that it can adapt to changes in the network because nodes on the network can move freely, so the arrangement of routing paths can change. There are two tests carried out to measure the feasibility of the system made, namely functional testing and performance testing. In functional testing the system can run well where nodes can collect all network information and choose the shortest path, send sensor data, forward sensor data from other nodes, and adapt to network changes such as disconnection of the selected path. Performance testing is conducted to test the ability of the system based on convergence time, packet delivery ratio, and delay with the effect of distance, number of hops, and delivery time intervals. The results of the functional testing of the node managed to meet all the requirements that have been determined. In the results of testing the performance of node convergence time it takes 7,365 seconds at a distance of 50 meters to get network information, while at a distance of 100 meters it takes 10,807 seconds. Then in the packet loss performance test, the lowest percentage is at a distance of 100 meters and the number of 1 hop jumps is 6% and the highest percentage is at a distance of 50 meters and the number of 3 hops jumps is 22%. In testing the delay performance, the lowest value is obtained at a distance of 50 meters and the number of 1 hop jumps is 276ms and the highest value at a distance of 100 meters 3 hops is 755ms.
Analisis Kinerja Protokol Routing Destination Sequenced Distanced Vector (DSDV) terhadap Serangan Blackhole dan Grayhole pada Mobile Ad Hoc Network (MANET) Made Ayu Gayatri Widhiastuti; Dany Primanita Kartikasari; Aditya Bhawiyuga
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 10 (2022): Oktober 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Technological advances make network infrastructure also increasingly developed. One example of the development of network infrastructure is the existence of wireless network technology or Ad-Hoc network. MANET is one type of Ad-Hoc network that has a flexible network topology and nodes on MANET can freely move places. Nodes in MANET that can move around, become vulnerable to security attacks that can threaten network performance in MANET. Blackhole and grayhole attacks are attacks on MANET. In this study using Destination Sequenced Distanced Vector (DSDV) routing protocol that is proactive with random waypoint mobility to determine the performance of the protocol against blackhole and grayhole attacks. The study was conducted using NS2.35 simulation and scenarios in the form of variations in the number of normal nodes and attacker nodes. Testing is done by using QoS parameters such as packet delivery ratio, average end-to-end delay, throughput and normalized routing load. The test results showed that there was a decrease in the performance of the DSDV protocol before and already Blackhole and grayhole attacks based on certain QoS parameter values.