Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer CYBERNETICS
Widhi Yahya
Fakultas Ilmu Komputer , Universitas Brawijaya
Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering

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

Found 65 Documents
Search

 1   2   3   4   5 
Implementasi Teknologi Virtualisasi Berbasis Kontainer untuk Perangkat Internet of Things pada Pertanian Presisi Mahendra Data; Widhi Yahya; Andika Kurniawan
CYBERNETICS Vol 3, No 01 (2019): CYBERNETICS
Publisher : Universitas Muhammadiyah Pontianak

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (292.645 KB) | DOI: 10.29406/cbn.v3i01.1448

Abstract

Pada bidang pertanian, Internet of Things (IoT) digunakan untuk mengendalikan sensor pertanian dan menghubungkannya dengan infrastruktur cloud dengan tujuan untuk menunjang pertanian presisi. Salah satu tantangan dalam penerapan IoT dalam pertanian presisi adalah keberagaman aplikasi dan protokol komunikasi di tengah keterbatasan sumber daya perangkat sensor yang digunakan. Ketergantungan library dan versi program yang saling kontradiktif mendorong diperlukannya terobosan baru dalam implementasi aplikasi sensor atau gateway pertanian presisi. Pada penelitian ini penulis mengimplementasikan virtualisasi berbasis kontainer untuk perangkat IoT pada pertanian presisi yang memudahkan pengimplementasian program pada satu perangkat tanpa mengurangi kinerja dari perangkat IoT. Program virtualisasi yang kami gunakan adalah Docker yang diimplementasikan ke dalam perangkat gateway IoT berupa Raspberry Pi. Hasil penelitian ini membuktikan bahwa penggunaan Docker, tidak menurunkan kinerja Raspberry Pi. Sehingga penggunaan Docker pada infrastruktur IoT pertanian presisi sangat mungkin untuk dilakukan karena memberikan keuntungan berupa kemudahan dalam implementasi, update, dan pengisolasian proses.
Analisis Perbandingan Penetration Testing Tool Untuk Aplikasi Web Bhaskara Vito Tarigan; Ari Kusyanti; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 3 (2017): Maret 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Penetration testing is a series of activities undertaken to identify and exploit security vulnerabilities. This helps confirm the effectiveness or ineffectiveness of security measures that have been implemented. This paper discusses the methodology in conducting penetration tests with a third tool penetration test is w3af, wapiti, and arachni. Penetration testing methodology includes three phases: test preparation, test and analysis test. Pilot phase involves the following steps: vulnerability analysis, information collection and analysis tool. This paper portrait is more to mengananlisa comparison tool that determines the penetration test and find out attacks anywhere that can be detected from the three tools that have been tested on existing vulnerabilities in web applications.
Implementasi Load Balancing Di Web Server Menggunakan Metode Berbasis Sumber Daya CPU Pada Software Defined Networking Riski Julianto; Widhi Yahya; Sabriansyah Rizqika Akbar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 9 (2017): September 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Nowadays, there has been a great traffic in the network. It is characterized by an increasingly high users will increase the complexity of the network such as increased server load and hard to configure any devices from different vendorss, so there needs to be a good web server. If a single web server, it will cause SPOF (Single Point of Failure). The use of cluster servers with load balancing will improve the performance of web servers implemented in Software Defined Network. Load balancing with resource-based methods is a load-sharing method using the smallest CPU usage of the server as a reference. Through the implementation of the system obtained server divide the load well. Testing with many connections and rate divided into 3 parts that is low to rate 40, medium to rate 80 and high for rate 160. The testing parameters used are throughput, response time, and CPU usage using Httperf and psutil tools. The results of the test obtained with the average throughput value of 947.9 KB / s, response time average of 6.2 ms, and CPU Usage of 59.82% on the first server, 69.73% on the second server and 93,24% on the third server. By comparison of the Round Robin algorithm, the CPU-based method is better than Round Robin based on the tests performed.
Analisis Perbandingan Metode Replikasi Server untuk Kebutuhan Pemulihan Bencana (Studi Kasus Sistem Informasi Geografis Perusahaan XYZ) Ulfa Khoirul Azizah; Ismiarta Aknuranda; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 10 (2017): Oktober 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

XYZ Company is one of the largest oil companies in the world, operating in more than 130 countries. To maintain its business process activities, XYZ company uses one of application called GIS Portal Mahakam. This application is installed on a conventional server in Balikpapan Base. To protect critical business processes from catastrophic failures, which can result in the loss of a company's ability to conduct business processes normally, XYZ companies undertake disaster recovery planning or DRP. In the implementation of DRP required process to replicate the GIS application server to Sepinggan Datacenter Recovery Center (DRC). There are three methods that support the replication server, namely the physical to physical, physical to virtual vmware converter, and physical to virtual baremetal restore. This study was conducted to compare selected replication methods, with the aim of obtaining the best replication methods to be applicable in the DRP process. The research data was obtained based on result of interview and observation. There are three methods of analysis performed. First, a comparison analysis of replication methods on the network side, storage, servers and operating systems, and applications. Second, the analysis of replication method using business impact analysis (BIA). Third, analysis of pros and cons on each replication method. Based on research that has been done, physical to virtual vmware converter method has maximum tolerable downtime for 1.375 days with the highest pros.
Analisis Perbandingan Performa Algoritma Round Robin dan Least Connection untuk Load Balancing pada Software Defined Network Agung Nugroho; Widhi Yahya; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 12 (2017): Desember 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The development of internet technology whom the users desire for the availaible services anytime tend to be increased following the current development which commonly not always supported by the increasing adequate server services. The highest users demand make the work load in server raised rapidly which cause down server in a short period along with the needs of technology which handle the utilization of complex connections. As a new technology, Software defined network offers scalability and programmability for the using of connections which become complex such as Balancing Web Server. There are some studies concerning with load balancing in Software defined network (SDN) with various algorithm which is applied will resulted difference performance from algorithm, , one of them is Round robin and Least connection. The experiment is done with 3 categories; low, medium, and high. The experiments parameter which is used are Throughput, Response time, and CPU Usage use Httperf and Psutil. Round robin Algorithm is more excellent than Least connection Algorithm in a tiny connection. On the other hand, for the bigger connection, Least connection Algorithm is excellent. The average value of time response shows the superiority of Round robin Algorithm rather than Least connection Algorithm. CPU Usage server with the Round robin Algorithm is more stable in each rate category. On the contrary, Least connection Algorithm is less of load than Round robin Algorithm in spite of the value is raise in each rate category.
Analisis Perbandingan Algoritma Floyd-Warshall dan Dijkstra untuk Menentukan Jalur Terpendek Pada Jaringan Openflow Ibrahim Attamimi; Widhi Yahya; Mochammad Hannats Hanafi
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 1 No 12 (2017): Desember 2017
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Software Defined Network (SDN) is network modeling that separates between control plane and data plane using Openflow protocol communication standard to connect both of them. SDN began to developed in recent years and has been widely implemented, one of them is network routing. There are two routing algorithms in this research which are Dijkstra and Floyd-Warshall. Both of these algorithms will be implemented using Mininet emulator and Ryu controller. Tests that performed in this research include parameters such convergence time, throughput, link failure, and resource usage. The result of convergence time test from this research showed Dijkstra's is superior to average of about 9,08-16,03milliseconds compared with the Floyd-Warshall with average of about 14,51-38,63milliseconds. Based on the results of throughput testing, both algorithms do not have significant differences. The Floyd-Warshall had an average throughput of 12.7-29.54Gbps while Dijkstra's had an average of about 12.89-29.22Gbps. For the test results from the Link failure, Floyd-Warshall is superior because it had a faster recovery time with average about 30.34-38.51seconds compared to Dijkstra's with average of 37.65-44.92seconds. Usage resource test showed that memory usage measurements for both algorithms share same memory, but CPU usage measurements showed the Floyd-Warshall consumes more CPU power compared to Dijkstra's.
Implementasi Alokasi Memori Dinamis pada Sistem Komputer Berbasis Clustering K-Means Florensius Tri Putra Simamora; Widhi Yahya; Sabriansyah Rizqika Akbar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 1 (2018): Januari 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Virtualization is the process of creating forms in virtual versions of operating systems, networks and others that can run applications like physical devices. Resources in virtualization become an important factor to support server performance. Sometimes resources are not fully utilized when resource allocation remains. As a result, when the server requires more resources, unused memory allocations can not be used. With memory allocation, the system can manage memory usage to maintain and improve server performance that can sometimes change. Application of memory allocation can be facilitated by algorithm and k-means regression method to predict the use of memory resources. To that end, the authors have implemented a dynamic memory allocation system on computer-based k-means clustering system. From the test results, the system is able to make changes in the form of upgrades and downgrades with the help of tools Apache Jmeter with time 2.5 seconds. Based on the results of tests that have been done, hypervisor successfully upgraded at 36.5699 seconds from 1 GB to 2 GB. Then second to 153.1348 hypervisor upgrade again from 2 GB to 4 GB. After the request to the server stops, the hypervisor downgrades the seconds to 611.709 from 4 GB to 2 GB then downgrade again in seconds to 624.4994 from 2 GB to 1 GB.
Pengembangan Sistem Monitoring Aktivitas Jaringan pada Mikrokomputer Raspberry Pi Frondy Fernanda Ferdianto; Widhi Yahya; Ratih Kartika Dewi
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 2 (2018): Februari 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The Internet of Things(IoT) development have been improved very well, the integration of device in various field become the prove. The IoT device number of use also increase, from this fact, IoT devices management become the challenge to solve. The solution of this challenge is network monitoring system that run effectively. The system must handle the constraint of IoT device power and computational performance too. The implementation of monitoring using SNMP is not effective, because the size of paket for transmission is big and not all component of SNMP protocol being used. The monitoring system that being developed use UDP protocol because of its simplicity and light-weight to IoT devices. The selection of data structure and database also give contribution to effectiveness of this system. The IoT devices that used for the development is Raspberry Pi, this device has been selected because of the good integration with the other sensors, so it will make the development of this system in future become possible. This system monitors the device resource and network activity, then the result will be displayed on a graph, so the user can get the information of the result. The network monitoring system that being developed is effective, because the use of device's resource is small. In one transaction, the data paket size which transmitted is 309 bytes, this is smaller than SNMP-based monitoring system.
Implementasi Network Slicing dengan menggunakan Flowvisor untuk Mengontrol Traffic Data Packet pada Jaringan Software Defined Network Ahmad Rizal Muttaqin; Widhi Yahya; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 2 (2018): Februari 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The rapid network growth resulted in SDN Networks will encounter heavy traffic or network traffic from various types of data packets. The density of network traffic and the different data packets will result in decreased network quality. This is due to differences in data packets that flood the network has different communication characteristics as well as the Transmission Control Protocol (TCP) packet and the User Datagram Protocol (UDP) package. The more dense and the difference of packet characteristics on network traffic, it is necessary to implement network slicing by using flowvisor to overcome the problem of decreasing SDN network performance. Through the implementation of this system obtained QOS test results throuhput TCP, throughput UDP, packet loss, and jitter. Implementation of network slicing with flowvisor has a distance average value of TCP and UDP througput better than the normal SDN network that is 380.359 and 0.535 Mbits / sec. The mean distance of packet loss and jitter value of network slicing implementation also has better value than normal SDN network that is 908,546 bytes on packet loss and 0.138 ms on jitter.
Analisis Load Balancing Pada Web Server Menggunakan Algoritme Weighted Least Connection Dany Rahmana; Rakhmadhany Primananda; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 3 (2018): Maret 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Load balancing is a technique to divide the workload on 2 or more servers when there is a request from the client. In load balancing techniques there are several algorithms,, others: least connection, weighted least connection and others. This research uses weighted least connection algorithm. The weighted least connection algorithm divides the server load based on the weight value. The supporting tool for load balancing is IPVSADM with Piranha interface. In the test, the measured parameters are throughput, response time and CPU usage. The tool used in the test in httperf. From the test results with delivery of 10000 connections obtained by sending connections per second more will increase the throughput value. On testing the highest throughput value is 547,74 KB / s. Compared with the response time response, if given a high connection will be higher in the sense of slowing down. In connection distribution testing, the server with the highest weights accommodates more connections of 4000 connections, the lowest weight of 1000 connections from the total 10000 connections. In CPU usage testing, the weighted least connection algorithm is at least better than the least connection algorithm when applied to a heterogeneous server.
Co-Authors Achmad Basuki Adhitya Bhawiyuga Adi Iman Utama Aditya Bhawiyuga Afredy Carlo Sembiring Agung Nugroho Ahmad Naufal Romiz Ahmad Rizal Muttaqin Andhika Dwitama Putra Andika Kurniawan Andreas Frederius Aprilia Kartika Sriastunti Aprillia Arum Pratiwi Ardy Frayogi ari kusyanti Arief Budi Setiawan Arnandha Hadi Pranata Aswin Suharsono Bagas Prawira Adji Wisesa Bagus Prasetyo Bagus Satria Wiguna Bhaskara Vito Tarigan Dany Primanita Kartikasari Dany Rahmana Dea Asmara Gita Delarta Tok Adin Dimas Dwi Radhityo Dimas Setiawan Afis Doni Hadiyansyah Enggar Saka Dirgantara Faizal Ramadhan Fariz Andri Bakhtiar Florensius Tri Putra Simamora Frondy Fernanda Ferdianto Gabreil Arganata Galeh Prehandayana Guntur Wahyu Pamungkas Hafidz Rizal Hafizhul Karim Hasbi Razzak Heru Nurwarsito Hilkya Dwima Palembangan Ibrahim Attamimi Imam Santoso Ismiarta Aknuranda Kasyful Amron Lalu Fani Islahul Ardy Landika Hari Suganda Lucky Ronny Chandra Negara M. Ali Fauzi Mahendra Data Maskur Purwiadi Moch. Wahyu Imam Santosa Mochammad Hannats Hanafi Mochammad Hannats Hanafi Ichsan Moh Wahyudi Putra Mohamad Rexa Mei Bella Mohammad Hafidzar Rakhman Muhammad Aji Wibowo Muhammad Luthfi Muhammad Rifqi Muzaki Muhammad Sholeh Muharrom Abdillah Niki Yuniar Wicaksono Nur Fauzi Panser Brigade Muhammad Poltak G. Hutajulu Pramukantoro, Eko Sakti Primantara Hari Trisnawan Rahadiyan Yuniar Rahmanda Rakhmadhany Primananda Ratih Kartika Dewi Reza Andria Siregar Rian Bayu Pambudi Risailin Dwi Jaka Fauzi Riski Julianto Romy Dwi Andika Manullang Sabriansyah Rizqika Akbar Sandy Ramadhan Wijaya Steven Urbani Tista Pamungkas Ragil Alit Uis Yudha Tri Wirawan Ulfa Khoirul Azizah Wijaya Kurniawan Yasin Rizqi Afandi Zavero Brillianata Abilovani Zefanya Hermanta