Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer CYBERNETICS
Mahendra Data
Fakultas Ilmu Komputer Universitas Brawijaya
Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering

Published : 49 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 49 Documents
Search

 1   2   3   4   5 
Analisis Performa State Snapshot Transfers (SST) Tipe Blocking (Rsync) dan Non Blocking (Xtrabackup-V2) pada MariaDB Galera Cluster Gilang Ramadhan; Mahendra Data; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 8 (2018): Agustus 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Reliability and availability of database server becomes the crucial things of application system. There are so many researches that have been done in order to increase the reliabilty and availability of database server. The example is using database replication mechanism. MariaDB is one of DBMS that has a replication mechanism through MariaDB Galera Cluster application. MariaDB Galera Cluster has several methods called State Snapshot transfer (SST) which is used for replication process, namely Rsync, Xtrabackup, Xtrabackup-v2, and Mysqldump. This study focused to compare the performance of Rsync method and Xtrabackup-v2 method. The experimental results show that both methods have a similar performance. Number of nodes in a cluster can affect the performance of cluster. Cluster with two nodes would be more vulnerable to become an error if one of the node becomes has failed. Therefore, the minimum number of nodes on a cluster is three on condition that there is just one node that failed. This experiment also results another conclusion that SST method that used and number of nodes can affect the replication times. Rsync method has a shorter duration of replication compared to the Xtrabackup-v2.
Analisis Performa Protokol 6LoWPAN pada Jaringan Sensor Nirkabel Menggunakan Cooja Simulator Wawan Darmawan; Sabriansyah Rizqika Akbar; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 8 (2018): Agustus 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

6LoWPAN (IPv6 over Low power Wireless Personal Area Networks), is an IPV6-based protocol that allows devices with small power consumption such as fixed sensors to connect and participate in IoT (Internet of Things) with greater scalability. This research simulate 6LoWPAN protocol on wireless sensor network (WSN) using Cooja simulator. Wireshark then used to analyse QoS (Quality of service) parameters, that is throughput, delay and jitter to know the performance of 6LoWPAN. Simulator is used because building a genuine propagation network takes a lot of time and costs. From the results of simulation that use cluster-based topology involving 10 clusters and routing protocol for low power and lossy network (RPL), the acquisition of throughput, delay and jitter based on Telecommunications and Internet Protocol Harmonization Over Networks (TIPHON) showing a good results. the highest throughput is obtained by Cluster 1 with 206 bps, the lowest delay was obtained by cluster 7 with 56 ms and the lowest jitter also obtained by cluster 7 with 0.003 ms. It can be concluded that the 6LoWPAN protocol performance on wireless sensor network is very good, consider the high throughput value with low delay and jitter value
Perbandingan Kinerja Protocol Routing Open Shortest Path First (OSPF) dan Routing Information Protocol (RIP) Menggunakan Simulator Cisco Packet Tracer Wahyu Sasongko Jati; Heru Nurwasito; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 8 (2018): Agustus 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Routing is very important for the process of taking a packet from a device and sending it through the network to another device on a different network. The routing algorithm affects the sending process of a packet and also the network that exists on the routing. In a network topology to transmit data is used a variety of routing protocols. OSPF with link-state algorithms and RIP using distance vector algorithms is the most of popular used routing protocols. This study was conducted to compare the performance of the OSPF and RIP routing protocols on LAN networks. By comparing and analyzing the required travel time of the routing protocol in sending a number of different data packets, we can know which routing protocol is the fastest on topology that has been designed. From the results of the study can be concluded that the OSPF routing protocol faster in the delivery of data packets by looking at the results of the travel time required to deliver a specified number of data packets.
Implementasi Constrained Application Protocol (CoAP) pada Sistem Pengamatan Kelembaban Tanah Yosef Febri Wiryawan; Dany Primanita Kartikasari; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 8 (2018): Agustus 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Recently, technology has been developed to facilitate human life in every aspects including agriculture. Implementation of technology in agriculture is still left behind for example in terms of observation soil moisture. Based on concept of Wireless Sensor Network (WSN) we can make a suitable network architecture to solve the problem. Wireless Sensor Network (WSN) is one of the emerging technologies which combine sensors and tiny embedded devices over a wireless communication medium. The aim of this study is how to make a reliable communication for the system. To accomplish our objectives, we implemented a lighweight protocol as a web transfer protocol named Constrained Application Protocol (CoAP) for the system. To collect the soil moisture data we integrated Microcontroller Wemos D1 and sensor YL-69 to perform as a sensor node, it sends sensing data to the server with bluetooth module HC-05. Then servers and clients will exchange data wirelessly using the CoAP protocol. To see the performance of the CoAP protocol, we tested the data exchanging that occurs between server and client in several scenarios. The test result revealed there is a significant increase of delay in payload size more than 64 bytes because of process blockwise mechanism in CoAP protocol. In addition, distance can also increase the delay in data transmission process.
Perbandingan Performa Database Apache HBase dan Apache Cassandra Sebagai Media Penyimpanan Data Sensor Internet of Things Dimas Malik Ibrahim; Rakhmadhany Primananda; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 8 (2018): Agustus 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Nowadays, internet has dominated the world, millions of data is exchanged daily either through web/mobile apps or internet use involving the objects around us to be able to communicate each another (currently known as Internet of Things/IoT). IoT requires a database with a good performance to be used as its storage media. Good performance it is like fast inserting data process and high level of availability. There are two types of databases at this time, Relational Database and Not Only SQL (NoSQL) Database. NoSQL Database is the proper type to be used as data storage media on IoT system because it has better scalability and availability level than Relational Databases. Of the many NoSQL Database, the author chooses HBase and Cassandra to compare their performance in this research, because both are the best in database Column-based storage model. The authors test the Throughput, Latency, Runtime CPU Usage, and Memory Usage using JMeter and YCSB to compare the performance of both these databases. The results suggest that Cassandra has Throughput, Latency and Runtime that is better than HBase. Meanwhile, HBase has CPU Usage and Memory Usage better than Cassandra.
Perbandingan Performa Intrusion Detection System (IDS) Snort Dan Suricata Dalam Mendeteksi Serangan TCP SYN Flood Emir Risyad; Mahendra Data; Eko Sakti Pramukantoro
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 9 (2018): September 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

In recent years, Snort and Suricata have become based open source IDS which are progressing rapidly. However, there has been a problem among users to select both IDS in the case of TCP SYN Flood attack detection. Previous researches have compared both IDS in terms of POD and Social Engineering attacks on a sophisticated scope. Therefore, this study will be conducted within the scope of a single core and an apple-to-apple scenario.There are three methods that have been applied to the test environment. These methods are launching packets with normal traffic and bad traffic. Another method is to combine the two traffic and launch it into the research environment. The use of these three methods aims to determine the performance of IDS Snort and IDS Suricata in dealing with TCP SYN Flood attacks. The parameters to be tested in this research are detection accuracy, detection rate, detection effectiveness and use of system resources.Methods such as calculating percentage accuracy and standard deviation calculations are used to analyzing and discussing the results obtained in this test. From the discussion it was found that Snort IDS excel in aspects such as detection accuracy, detection speed and detection effectiveness. However, IDS Suricata is more efficient in resource usage compared to Snort IDS.
Analisis Performa Load Balancing Pada Broker MQTT Menggunakan Algoritma Round Robin Kevin Charlie; Rakhmadhany Primananda; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 9 (2018): September 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

MQTT is a communication protocol that requires a small resource and bandwidth. MQTT uses a broker in charge of connecting publishers and subscribers. MQTT brokers, especially Mosquitto, do not have mechanisms to overcome failures caused by CPU overload or device damage when only one broker is used. Thus, it takes load balancer and some brokers. In this research, a load balancer performance analysis using round robin algorithm is used to distribute MQTT brokers workload. The study was conducted on a single host using virtualization. There are 4 virtual devices, namely 3 brokers and 1 load balancer. Subscriber subscribes to the topic by accessing the load balancer address. Testing is done by using load balancer as differentiator variable to know impact given load balancer to broker. The result shows that load balancer with round robin algorithm is able to distribute the load evenly with the condition of all connected clients without any interruption with 13.56%, 13.68% and 15.12% CPU load for each broker with request of 400 that receive 10 publish message for each client. Then the system is able to reconnect to other brokers with a speed of 1.007 seconds when traffic is low and 1.005, 2.791, 4.593, and 2.005 seconds when traffic is high. Finally, the broker's message distribution takes about 0.362, 0.687, 0.891, 1.199, and 1.622 seconds for the number of publish messages of 25, 50, 75, 100, and 125.
Prediksi Intensitas Curah Hujan Menggunakan Metode Jaringan Saraf Tiruan Backpropagation Defanto Hanif Yoranda; Muhammad Tanzil Furqon; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 10 (2018): Oktober 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The intensity of rainfall is quite difficult to predict. Many things can be the factor of rainfall, such as temperature, wind speed, humidity, air pressure, and others. This rainfall factor is a major component that is difficult to predict and calculated, therefore rainfall forecasting is a very interesting thing to discuss, because it will be very useful for various things. Many forecasting methods can be used for forecasting, such as the Backpropagation Neural Network used in this study. This research will use time-series data, monthly rainfall data obtained from Kab. Ponorogo. The best result of this research is test MAPE of 20.28% obtained from training using data from Balong rain gauge station. The training process uses 10 neurons on the input layer, training data from 1997 to 2015, test data in 2016, 40 neurons on the hidden layer, a MAPE limit of 20%, and a maximum of 200000 iterations. Test MAPE is classified as not very well and too high due to there are many 0 values in the data.
Perancangan Laboratorium Komputer Virtual Mandiri Untuk Praktikum Jaringan Komputer Dasar Menggunakan Docker Iman Aidil Nugraha; Mahendra Data; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 11 (2018): November 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Laboratory is a means to conduct the process of practicum at a university. The purpose of a practicum is held so that students can directly implement the material obtained at the time the lectures take place in the classroom. However, when practicum there are students who are difficult to perform the installation of practical purposes, it is caused by the uniformity of configuration requirement of practicum between lecturer and student. To overcome these problems it takes a virtual laboratory to do a practicum. This virtual laboratory serves as a lab that can be accessed virtually on each student device. In this study used the docker engine as a virtualization software provider. Practicum used as virtualization is a computer network practice module that each chapter will be used as an image using docker. Furthermore, to run the lab can be through the container provided by the docker. Docker is chosen because the use of memory, processor and storage are more efficient. Tests conducted in this study is a test of computer performance, which is seen from memory usage and CPU usage. the test performed resulted in the use of memory of 1.21MB and 0.7% of CPU usage on packet capturing practice, 6.77MB and 0.6% CPU usage on socket programming practice, 2.30MB and 2.93% CPU usage on protocol layer transport pratice.
BitTorrent dengan Reactive Routing pada Software-Defined Network Landika Hari Suganda; Widhi Yahya; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 11 (2018): November 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

BitTorrent is a file sharing application that uses a peer-to-peer mechanism to distribute pieces of files (chunk). The process of determining the seeder is still done randomly, so to get the optimal seeder needs to be optimistic unchoking. In this study BitTorrent is implemented with software a defined-network concept that separates the control plane and data plane to facilitate application development. The reactive routing controller creates a flow table that use to connect between the peers and determines the peer list as the nearest seeder based on the number of hop using the Dijkstra algorithm. The simulation results show that the system can select some of the nearest seeders by reactive routing based on the number of hops traversed. we use BitTornado for application BitTorrent client and use Pybtracker for application of tracker. Here we observe download rate and throughput generated on BitTorrent application with random seeder and BitTorrent application that has been modified with controller. The test results obtained an average value of download rate 4785.3 Kbps with 25 seconds distribution time on 3 random seeders, 6378.3 Kbps with a distribution time of 17 seconds on 5 random seeders, 6721.9 Kbps with 18 seconds distribution time on 7 random seeders and 5990.8 Kbps with time distribution of 18 seconds on 3 seeders, 6732.1 Kbps with 15 seconds distribution time on 5 seeders, 7656.53 Kbps with 15 seconds distribution time on 7 seeders.
Co-Authors Adhitya Bhawiyuga Agung Pambudi Andhika Brahmana Putra Andika Kurniawan Andika Kurniawan Andreas Frederius Andri Warda Pratama Putra Anggi Atmajaya Siagian Anggit Surya Gumilang Aprillia Arum Pratiwi ari kusyanti Binariyanto Aji Brillian Taufan Budi Darma Setiawan Dany Primanita Kartikasari David Christanto Defanto Hanif Yoranda Dhani Wahyu Wijaya Dian Eka Ratnawati Dimas Malik Ibrahim Dimas Setiawan Afis Dwi Qunita Putri Ambeq Paramarta Emir Risyad Fahmi Syahrulah Faris Muslim Azmi Ferdi Cezano Santosa Feriz Pradibya Uditama Gilang Ramadhan Heru Nurwarsito Heru Nurwasito Heru Nurwasityo Hilman Adi Kartika Ibnu Aqli Iman Aidil Nugraha Indah Larasati Karmila Dewi Sulistyowati Kasyful Amron Kevin Charlie Kusnul Aeni Landika Hari Suganda Mohamad Rexa Mei Bella Muhammad Irfan Syafi'i Muhammad Luthfi Muhammad Tanzil Furqon Muhammad Wahyu Rizqi Pratama Novita Krisma Diarti Pramasita Gustiarum Pramukantoro, Eko Sakti R. Moch Makruf Puja Pradana Rakhmadhany Primananda Rani Andriani Reza Andria Siregar Rizal Dismantoro Rohbi Visdya Harris Chandra Sabriansyah Rizqika Akbar Tiara Erlinda Veny Charnita Br Ginting Wahyu Sasongko Jati Wawan Darmawan Widhi Yahya Yoga Rizwan Priyatna Yosef Febri Wiryawan Yosua Tito Sumbogo Yuniar Siska Fatmala