Article Per Year (5 Year)
p-Index From 2021 - 2026
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

 3   4   5   6   7 
Implementasi Load Balancing Server Basis Data Pada Virtualisasi Berbasis Kontainer Moch. Wahyu Imam Santosa; Rakhmadhany Primananda; Widhi Yahya
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 (422.545 KB)

Abstract

Most of systems that we use nowadays still implement single database server architecture. It makes database server incapable in handling many requests. Horizontal scaling that is done with additional processing units such as nodes, instances, or even containers is a solution in increasing performance of a system in handling many requests. Load balancer is needed as a system that will be used to distribute data requests to the system of database server. In this research, the author tried to solve the problem by implementing load balancing database server in container-based virtualization. Load balancing runs using load balancer and nodeport features that provided by Kubernetes. With each of the replicas connected in a centralized storage system, it makes the data consistent. The result shows that the performance of database server is increased, with throughput that was obtained from load of 750 per second was (61,3 request per second) in 2 replicas, (61,3 request per second) in 3 replicas, (64,6 request per second) in 4 replicas, and (65.,6 request per second) in 5 replicas.
Impelementasi Hardware Redundancy Pada Switching Pintu Otomatis Dengan Metode Cold Standby Dan Watchdog Muhammad Rifqi Muzaki; Sabriansyah Rizqika Akbar; Widhi Yahya
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 (1076.779 KB)

Abstract

Electronic devices must have a lifetime limit and may be damaged at any time. A system consisting of several electronic devices will fail if the crucial component is damaged. Therefore, crucial components in a system should be more reliable. To improve system reliability a mechanism such as Hardware Redundancy can be applied. Hardware Redundancy is a mechanism to improve reliability by duplicating important components as backup. There are several types of Hardware Redundancy mechanisms, one of which is Cold Standby Redundancy which uses the unpowered backup concept. The Cold Standby concept is to add a duplicate of an important component that standby without a power supply and will be active when the component is damaged. In this study Cold Standby Redundancy is applied to an automatic door lock system based on Arduino Uno and RFID. An important component of the system is Arduino Uno which acts as a controller in the system. Implementation of cold standby redundancy on this system uses a third party device (Arduino Nano) as the fault detector of main Arduino Uno (master). Through I2C serial communication the master sends keep-alive status periodically to the fault detector as a sign of whether it is still operating or is being damaged. In addition there is a switch device in charge of switching the system control to master or slave. The fault detector sends the trigger to make a switch to the switch device when it detects damage to the master. Based on the results of tests that have been done, system reliability increases after applying the Cold Standby Redundancy mechanism. System reliability value increased by 15.45% for a year operating time.
Analisis Kinerja Openflow Based Switch pada Router Linkysys WRT54GL dan TP-Link TL-WR1043ND Dalam Arsitektur Software Defined Networking Yasin Rizqi Afandi; Sabriansyah Rizqika Akbar; Widhi Yahya
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 (545.936 KB)

Abstract

In software defined network architecture (SDN) there is an open source protocol called Openflow. Openflow can be added to the open interface device. The Linkysys WRT54GL and TP-Link TL-WR1043ND routers can use Openflow by installing open-source firmware such as Openwrt. Several previous studies have tested the performance of LInkysys WRT54GL and TP-Link TL-WR1043ND routers based on network resource parameters such as throughput, round trip time and jitter. This study is conducted testing the performance of the Openflow protocol on the SDN architecture with adding parameters of computational. Computational parameters include the use of CPU and memory resources then, network parameters include round trip time, throughput and flow table formation time. Based on all test results, the addition of Openflow on the Linkysys WRT54GL and TP-Link TL-WR1043ND router who installed openwrt, can increase the use of CPU and memory resources and can degrade network performance such as round trip time and throughput. The decrease performance of router is due to the addition of the Openflow process on the router who cause decreased the switching performance and the mechanism of the Openflow hybrid switch who cause increased forwarding data processing time .
Implementasi Protokol MQTT Untuk Sistem Monitoring Perangkat IoT Zavero Brillianata Abilovani; Widhi Yahya; Fariz Andri Bakhtiar
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 (1146.976 KB)

Abstract

Internet era at this time has developed a technology called Internet of Things as known as IoT. Where IoT is able to transmit data automatically from computer to computer without the initiation from humans. However, with size and number of data that increased will be transmitted make IoT devices performance has a negative result. Efforts are being made to overcome these problems, namely the need for a system that is able to manage devices and can monitor and maintain availability of IoT devices. One way is to make an IoT device monitoring system that aims to monitor when there is a disruption to the device. By implementing the MQTT protocol which is a protocol that implements the publish-subscribe mechanism and runs on the application layer. The MQTT protocol can process the send and receive of messages to manage and monitor according to the user's wishes, because the send and receive of messages by predetermined topics. Based on results rather than testing, the MQTT protocol has a smaller resource requirement than the UDP protocol and has a smaller data packet size than the SNMP protocol. The IoT device monitoring system that uses the MQTT protocol also has a small delay of 0.008634 sec and a throughput value of 9.2 MBit / sec. So that the system can run on low bandwidth and high latency.
Implementasi Jaringan Wireless Mesh Berbasis Protokol Babel Untuk Video Streaming Menggunakan Codec H.264 Hilkya Dwima Palembangan; Widhi Yahya; Reza Andria Siregar
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 (243.594 KB)

Abstract

Wireless mesh network is a network consisting of several devices that are connected to each other to send and receive data, and act as a relay for sending data on a small network scope. Because video streaming process in a network requires connection between the server and the client that runs continuously and real time, so the codec used, the size of the video, and the location of the server and client affect the quality of video streaming results. Recommended standards for video streaming to run smoothly is that the jitter value is no more or equal to 10 ms to 50 ms, and packet loss is not more than 0.5%. In this study, testing of video streaming is carried out on a wireless mesh network based on Babel routing protocol with a limited number of devices using H.264 and MJPEG codecs. The quality of network service in each test scenario is determined in the form of delay, throughput, jitter, and packet loss, then the test results between H.264 and MJPEG codecs are compared. After testing, H.264 codec has packet loss value of 2.14% while the MJPEG codec has packet loss value of 5.03%. H.264 codec has a jitter value of 164154.38 ms while the MJPEG codec has a jitter value of 305.67 ms. H.264 codec has a throughput value of 0.016 MB/s while MJPEG codec has a throughput value of 0.047 MB/s. H.264 codec has a delay value of 0.036 ms while the MJPEG codec has a delay value of 0.0306 ms. Jitter and packet loss value from testing using the H.264 codec do not meet the recommended standard values for video streaming.
Implementasi Load Balancing Web Server Dengan Algoritme Weighted Least Connection Pada Software Defined Network Hafizhul Karim; Rakhmadhany Primananda; 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 (594.288 KB)

Abstract

The problem of the web server is many of requests used by the user so that the workload on the server increases quickly resulting in the server down. Loadgbalancing is a techniqueato distribute incoming traffic between available serversaso that requestsxcan beahandled and respond faster. This research uses weighted least connection algorithm. The weighted least connection algorithm divides the server load based on the weight value. Software Defined Network Architecture (SDN) is programmable and provides facilities to the Network Administrator to design and implement load balancing strategies without vendor limitations. For implementation use mininet and controller used with POX. Parameters used for testing are connection rate, throughput, and CPU usage. The tool used for testing is httperf. The result of connection rate and throughput testing by giving client request 3000 with the rate of 75, 150, and 300 with the highest connection rate is 296,28 Conn/s, the lowest response time is 2,34 ms and the highest throughput value is 805,66 KB/s. And the last result of testing CPU usage, server 1 has a value of 21.6%, server 2 has a value of 24.6%, and server 3 has a value of 26.3%.
Implementasi Server Failover Pada Software Defined Network Dea Asmara Gita; Sabriansyah Rizqika Akbar; 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 (348.264 KB)

Abstract

Client-Server architecture is an architecture in computer network which involves data exchanges between two devices, in this case client and server. The server role in Client-Server architecture is very important because the server has a task to provide services that required by the client. So, if the server is down, client can't access services that server provides. To solve this problem, we need a high availability system. Many high availability systems which have been built uses master and slave model. In this study, high availability system in Client-Server architecture is built using Software Defined Network technology. Software Defined Network is a network architecture that separates between control plane and data plane. We hope Software Defined Network has a controller which gives information of the network, so the failover process will be faster. We get results of 0.826 second on average downtime, 0.865 second on average failback time, and 5.6% packet loss rate on failover process.
Analisis Perbandingan Kinerja Metode Load Balancing Berbasis CPU Dengan Berbasis Response Time Pada Software Defined Network Muharrom Abdillah; Widhi Yahya; Achmad Basuki
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 (604.965 KB)

Abstract

Server is part of important thing in a service inside computer network. the purpose of server can determine how fine the quality of the services. More request will make the server have more loads and decreasing performance of server. The solution is to use multiple servers that implement load balancing method, so that servers performance becomes more stable. Load balancing method implemented in software defined network. This architecture offers scalability and programmability for more complex network like load balancing for web server. There are any research about load balancing in SDN with several method implemented, they are round robin method, CPU usage based method and response time based method. This research give analysis to performance of round robin method, CPU usage based method and response time based method. The trial are doing to three categories of rates, they are low for rate 40, medium for rate 80 and high for rate 160. The trial are doing in 10 seconds for each rate. The parameters used in this trial are throughput and CPU usage. The throughput test resulting that round robin is excellent in low category with average value 32,64 KB/s, meanwhile in medium and high category response time method is more excellent with average values 65,02 KB/s and 115,50 KB/s. Whereas, in CPU usage test, CPU usage method have the lowest standart deviation with average values 3,95%, 4,69%, and 5,90%.
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.
Implementasi Load Balancing menggunakan Algoritme Least Connection dengan Agen Psutils pada Web Server Muhammad Sholeh; Widhi Yahya; Primantara Hari Trisnawan
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 (770.522 KB)

Abstract

Social media and news sites are services on the Internet that are most visited by Internet users. These services are required to be able to handle very high traffic.. If the service uses a single web server, it can cause a Single Point of Failure. The solution for that problem is to use a method of load balancing. Load balancing is a method that can distribute traffic to multiple servers based on the algorithm used. This research develop the Least Connection algorithm for load balancing in the Software Defined Network (SDN). Least Connection is a load balancing algorithm that will direct traffic to web servers that have the least connection. This research uses an agent called Agent Psutils. This agent send information to SDN Controller about the number of active connections of web servers. From this information, SDN Controller can direct traffic to web servers that have the least connection. The results of the study show that the Least Connection algorithm with Agent Psutils can distribute traffic based on the number of active connections on server. Then, when comparing the Least Connection algorithm based on Agent Psutils (LC Agent Psutils) with Least Connection based on Expired Flow (LC Flow). LC Agent Psutils can send data measuring 1.2 GigaBytes while LC Flow cannot complete the data transmission process. At 400 requests, LC Agent Psutils have a smaller response time than Round Robin and LC Flow. Where the response time of the LC Agent Psutils is 242.51 ms, while the Round Robin and LC Flow are 261.61 ms and 279.81 ms.
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