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 
Perancangan Klaster Server Web Dengan Availabilitas Tinggi Menggunakan Teknologi Failover, Load Balancing dan Distributed File System Tiara Erlinda; Mahendra Data; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The developments of World Wide Web (WWW) technology has an impact on the increasing website every day. The use of the web for everyday life is very influential for various aspects of life such as to communicate, entertainment, and education. It takes a system that has a high availability level to operate continuously and ensures no failure so that the system can provide continuous service without interruption to the user. The researcher's solution is to design a high availability web server cluster with failover technology using Keepalived. There is also load balancing technology using Varnish which supports distributing workloads to web servers and distributed file systems using GlusterFS to share files between servers. The study was conducted using LAMP server ie Linux Apache, MySql and PHP. Apache server is assigned as web server. Testing is done in terms of downtime, throughput, CPU usage, memory usage and functional. The results of the research found that the value of downtime with an average of 1 second when the main server is dead. The highest throughput value for the connection is obtained when the number of connections is 40 and the lowest when the number of connections is 100. The usage and memory usage values ​​increase up to 68.3% for CPU and 65.5% for memory depending on the number of connections. The result from functional test proved that the system is running according to its function. Based on these results, this system can be a solution for systems that require high availability.
Implementasi Sistem Pendeteksi Rogue Access Point Dengan Metode Perhitungan Nilai Round Trip Time Fahmi Syahrulah; Adhitya Bhawiyuga; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

With the increasing development of wireless technology, which provoke the cyberattack using wireless technology increase as well, this would make user data be put to risk. One of the cyberattack that exploit wireless technology is Rogue Access Point. To prevent this, RAP detection system was made with comparing round trip time method. This system sent a DNS lookup to get round trip time. RAP would return much longer round trip time value than the legitimate access point, this happen because the added hop that was passed during the trip to RAP. To minimalize the impact from unstable network that would affect the accuracy of detection system, filtering mechanism is used to filter round trip time value that is deemed as an anomaly. Testing will be done to the two similar access point which one of them is the RAP. Round trip time value from both access point will be compared, which will be used as parameter to determine RAP. In this research the accuracy detection would be never less than 90%.
Analisis Perbandingan Kinerja File System GlusterFS dan HDFS dengan Skenario Distribusi Striped dan Replicated Muhammad Irfan Syafi'i; Adhitya Bhawiyuga; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Big Data is a term used to describe the growth of large data, both structured data and data not tersrukur. Big Data has three main characteristics: volume, velocity, and variety. The problem that arises with the development of Big Data is how to store the data. Data that continues to grow enlarged each time requires a large storage space as well. This certainly will not be able if the storage space is in one machine (single node / host). Distributed file system is a storage and file management module consisting of multiple machines (multi node / host). This study aims to compare the performance of two file systems, GlusterFS and HDFS in distributed file storage with striped and replicated distribution scenarios. The study is limited to the measurement of file system performance in performing write / read file operational. The test results show that the performance GlusterFS have a lighter in performing write file operations with the acquisition of 44.54 MBps throughput, execution time for 58.54 seconds, CPU usage for 54.83% and memory usage for 3.6%. HDFS has the optimal performance on read files operations, obtained the average of throughput for 194.37 MBps, execution time for 16.01 seconds, CPU usage for 86.9% and memory usage for 18.5%.
Perancangan Sistem Pengamanan Data Transaksi Pada Database Terdistribusi Menggunakan Metode Hashing Agung Pambudi; Ari Kusyanti; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

In e-commerce, payment outlets are needed as intermediaries, so that purchase can be processed. One of e-commerce in Indonesia is owned by PT. Kereta Api Persero Tbk. The interconnection of transactions on several payment outlets requires a database distribution. This will cause new problems, because the database has a security gap, namely the possibility of transaction data manipulation. Therefore a system that can guarantee transaction data cannot be manipulated is needed. The hashing method is used to calculate the digest value of incoming transactions from payment outlets. Then, the digest value will be sent in turn with transaction data to the online ticket server. Afterward, the digest value from the previous transaction and the latest transaction will be recalculated and resulting a new digest value. This proces is repeated until a hashing chain is created. In this way the payment records will be the same and each data record will be bound. Hence, changing one data record transaction, will damage the composition of the other transaction data records. The composition of a valid data record will be an indication of data integrity of data transaction. This system is implemented successfullywith execution time of every record calculation takes approximatelly 5 seconds.
Perbandingan Kinerja Haproxy dan Zevenet Dalam Pengimplementasian Multi Service Load Balancing Faris Muslim Azmi; Mahendra Data; Heru Nurwasityo
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The development of information technology has been growth rapidly over time thus escalated the needs for information services. Each user has different needs of information services. Thus, a multi-service load balancing system is required to minimize traffic congestion and to reduce server's workloads. Load balancing is a computer network method to distribute loads on servers. HAproxy and Zevenet are load balancers that support various services such as HTTP and FTP. In this research, the conducted test is performance comparison of HAproxy and Zevenet in the implementation of multi-service load balancing. Performance testing is done by sending 1000, 2500 and 5000 HTTP and FTP connections on both HAproxy and Zevenet. The algorithms used in this test are round robin and least connection and the experiments parameter which is used are response time and resource utilization. Based on the performances test result, both on HTTP and FTP services, HAproxy showed better test results on the response time parameter. While Zevenet showed superior test results on resource utilization parameter on both HTTP and FTP services.
Analisis Performa Proses Enkripsi dan Dekripsi Menggunakan Algoritme AES-128 Pada Berbagai Format File Rohbi Visdya Harris Chandra; Ari Kusyanti; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Every company has data that must be stored in digital form. Along with the development of the company, the data that needs to be stored will be more and more, so that the storage space needed will also be greater. In addition, data security factors also need to be considered. One method of securing data is by encrypting data. In the research conducted is an encryption algorithm analysis, which according to the results of the analysis shows that the AES algorithm shows an algorithm recommended as an algorithm to secure file usage. This study proposed an analysis of the AES encryption method. There are several parameters for testing the encryption method, namely encryption costs, computation time and testing several file formats encrypted and decrypted with file size references for document and image file formats, for audio and video file formats referring to the time duration, then from each file format selected two file extensions used for testing. Based on the results of the test shows that the AES encryption method provides good results for a number of file formats, AES-128 is able to encrypt files well even though it requires a long computing time in some of the file extensions tested. The time needed for the encryption and decryption process using the AES algorithm is affected by each different file size, the larger the file size used, the longer computation time needed.
Implementasi Algoritme Trivium Stream Cipher Dan Shamir's Secret Sharing Pada File Portable Document Format (PDF) Muhammad Wahyu Rizqi Pratama; Ari Kusyanti; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Securing data in the form of files by encrypting the files is one way to secure data in the concept of cryptography, so that other people who are not entitled to find files that are private or confidential. In this study implementing data security using two cryptographic algorithms namely Trivium Stream Cipher and Shamir's Secret Sharing. Both algorithms are applied to a *.pdf format document file. * .pdf document file format is a file format that is widely used when sending files because it can be distributed on any computer with the same look. But with the development of technology, the security of this file also weakens like tapping or losing. Therefore we need a method that can improve the security of this * .pdf format document file. It is expected that by combining these two algorithms can improve security in * .pdf format files. From the testing that has been carried out this system requires an average execution time of 2.363 seconds for a file size of 15 Kb, 6.384 seconds for a file size of 31 Kb and 12.456 seconds for a file of size 40 Kb.
Analisis Perbandingan Kinerja Algoritme Dijkstra, Bellman-Ford, dan Floyd-Warshall Untuk Penentuan Jalur Terpendek Pada Arsitektur Jaringan Software Defined Network Aprillia Arum Pratiwi; Widhi Yahya; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Software defined network (SDN) is a centralized and flexible network concept compared to traditional networks that exist today. SDN has been developed in the last few years and has been widely implemented, one of which is routing networks. Routing is the process of finding the communication path used to send packets from the sender to the recipient. The implemented routing algorithm is tasked to determine the shortest paths, namely Dijkstra, Bellman-Ford, and Floyd-Warshall algorithms. The three algorithms will be implemented using the Mininet and Ryu controller emulators. For determining the path required the determination of the link or cost weight. Cost in this study is based on the calculation of the reference bandwidth of 1000 Mbps and the bandwidth link that uses three types of capacity quantities, namely 10 Mbps, 100 Mbps, and 1000 Mbps. Testing is done with parameters, namely validation, convergence time, throughput, recovery time and packet loss. Based on the results of validation, the system runs according to the calculation of the manual calculation of each algorithm. In convergence time testing, Dijkstra was superior with an average of 0.0087 seconds compared to Bellman-ford 0.0094 seconds and Floyd-Warshall 0.02025 seconds. In testing the three throughput algorithms do not have far distinction. Based on recovery time testing, the Floyd-Warshall algorithm has faster recovery time than other algorithms. Based on the testing of packet loss Dijkstra is still superior in handling packet loss when sending.
Load Balancing Server Web Berdasarkan Jumlah Koneksi Klien Pada Docker Swarm Dimas Setiawan Afis; Mahendra Data; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Most web servers that are used today still use single backend server architectures. The problem that arises is how the single server is able to handle large data requests. We must consider using web server clustering to improve web server reliability. We built this cluster using virtualization technology such as virtual containers. One of the container-based virtualisations currently is Docker. However, managing multiple containers to make a single service is a challenging task. Docker introduces a distributed system development tool called Docker Swarm. We propose a load balancing mechanism on Docker Swarm to balance internal load, so that it can distribute requests to web server. In addition, we also try to find out the performance of roundrobin and leastconn algorithms on loadbalancing mechanisms that will be used on Docker Swarm. The test results show that loadbalancing applying the least connection algorithm has a throughput of 15 Mbps in 1000 requests, 17 Mbps in 3000 requests, 17 Mbps in 5000 requests, while the round robin algorithm has a throughput of 15 Mbps in 1000 requests, 14 Mbps in 3000 requests, 15 Mbps in 5000 requests. The results show the least connection algorithm has better performance than the round robin algorithm. In addition, the results of data distribution are balanced on each available web server.
Implementasi Penyimpanan Data Persisten pada Docker Swarm Menggunakan Network File System (NFS) Andreas Frederius; Mahendra Data; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 2 (2019): Februari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Docker Swarm is a distributed system development technology for managing the Docker engine group. With Docker Swarm you can run multiple containers at the same time in the Docker engine group. In a distributed method using Docker Swarm a persistent data storage is needed. But facing Docker Swarm stores data on the container, if the container is deleted then the data will also be deleted. Therefore we need a persistent alternative storage data. Network File System (NFS) is an open protocol that can be used to share files on many computer networks and operating systems. The design of the NFS architecture on Docker Swarm uses a client-server architecture. Docker Swarm as a client and NFS as a server. NFS is able to provide persistent storage data on Docker Swarm by configuring data even if the container and machine are restarted. NFS can prepare data on Docker Swarm to retrieve data that has been stored on NFS-3 data remains persistent. The average write speed performance on NFS is 30,168 KB while the working speed of reading the average on NFS is 63,939 KB.
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