Article Per Year (5 Year)
p-Index From 2021 - 2026
2.557
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering TELKOMNIKA (Telecommunication Computing Electronics and Control) Jurnal EECCIS Journal of Environmental Engineering and Sustainable Technology Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Network Engineering Research Operation [NERO] Jurnal Teknik Mesin dan Mekatronika (Journal of Mechanical Engineering and Mechatronics)
Achmad Basuki
Faculty Of Computer Science, Universitas Brawijaya
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Education Electrical & Electronics Engineering Energy Engineering Environmental Science Materials Science & Nanotechnology Mechanical Engineering Transportation

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

Found 58 Documents
Search

 1   2   3   4   5 
Analisis Kinerja On-Path Caching Dan Off-Path Caching Pada Information-Centric Networking Muhamad Rizka Maulana; Achmad Basuki; Kasyful Amron
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 (1092.596 KB)

Abstract

The massively increasing Internet traffic is not supported by the current Internet architecture which is still based on host-centric communication. Information-centric networking (ICN) paradigm has been proposed to resolve that problem with content-centric communication. Some ICN architectures have been proposed, such as CCN, DONA, and NetInf. Those proposed architectures generally have three main concepts, which are publish-subscribe operation, in-network caching, and content-oriented security. In-network caching plays a very important role in ICN paradigm. It can improve network performance by saving content in caches that are spread in the network. This research aims to compare on-path caching and off-path caching strategies using Biznet topology on Icarus simulator. The result shows that off-path caching has 12.45% higher cache hit ratio than on-path caching, and on-path caching has 63.14% lower link load and 42,07% lower latency than off-path caching. In addition to that, it is worth noted that bigger cache capacity and α value results in higher cache hit ratio, lower link load, and lower latency.
Desain dan Implementasi In-Network Caching Pada Content Centric Networking Menggunakan CCN-Lite Dengan Simulator OMNeT++ Ibrahim Ibrahim; Achmad Basuki; 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 (380.131 KB)

Abstract

Content Centric Networking (CCN) is a proposed architecture for addressing current Internet issues in terms of data distribution. The CCN is content-centric based, where the data search is performed using the name of the content, not the content host. CCN also has a different caching mechanism than caching in general called in-network caching. This study aims to find out how the performance of in-network caching on CCN by design and implementation using CCN-Lite in OMNeT ++ environment. The parameters tested were delivery latency and cache hit ratio (CHR). The result of the simulation is done, the smallest delivery latency is 10.69 ms. This value is obtained from the caching process, when compared with the latency of delivery without caching that is equal to 32.45 ms. It proves that with the caching, the latency gets lower. The highest CHR obtained in the CCNTLV protocol file is 0.54 or 54%, when compared with the CCNB file protocol of 0.45 or 45%. This proves that the higher the value of CHR the better the content is served.
Analisis Perbandingan Kinerja Algoritme Fair Share Scheduling Dengan Capacity Scheduling Terhadap Pengiriman Job Pada Hadoop Cluster Multinode Friska Anggia Nurlita Sari; Adhitya Bhawiyuga; Achmad Basuki
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 (1121.829 KB)

Abstract

Hadoop is a framework based on an open-source which is used for a data processing in a large scale and stored in a group of interconnected computers that are connected in a network which are distributed. Hadoop there are several scheduling algorithms to set the incoming job queue, jobs that have been submitted by the user will compete for a resource available. So the need for a scheduling algorithm in charge of managing the job on a resource and managing the data processing so that output issued in accordance with what is expected. This research was conducted to find out the comparison of performance of Fair Share Scheduling and Capacity Scheduling algorithm on job delivery on Hadoop multinode to know the value of Job Fail Rate, Latency, and Throughput parameters. Capacity Scheduling supports the queue in a hierarchy that is able to divide the available resources in the cluster into multiple queues. Fair Share Scheduling is a fair allocation of resource allocation methods for queues for all jobs that enter the queue. Based on the results of tests that have been done, has a minimum value of Job Failed Rate is better than Fair Share Scheduling of 0.99%. Fair Share Scheduling has a minimum value of better Latency of 19.25 minutes. While the value of Throughput on Fair Share Scheduling faster by 0.47 Mbit/s.
Analisis Performansi Protokol Routing Epidemic Dan Spray And Wait Pada DTN Berdasarkan Mobilitas Node Jodi Prayoga Wahyudwi; Rakhmadhany Primananda; Achmad Basuki
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 (1307.36 KB)

Abstract

DTN or Delay Tolerant Network is an internet network that does not matter the time delay. In this study, DTN routing analysis using Epidemic and Spray And Wait based on node mobility. In DTN routing use The One simulator application to list route path with actual city condition. In the performance appraisal, three test parameters were used: Probability of Submission, Overhead Ratio, Average Latency. In the first scenario, the highest Delivery Probability on the Open Shortest Path Mobility is 0.9853 messages, the second ranked Map by Movement of 0.9412 messages, and the last Route Movement Map of 0.9265 messages. In the second scenario, High Possibility on Mobility of Movement Based Map by 1 message, second rank of Open Shortest Path and Movement Map Map with the same value is 0.9796 message. On the third map of the highest Delivery Probability on Mobility Route Map Movement for 0.9457 messages, the second ranked Map Based Movement of 0.9225 messages, and last Open Shortest Path of 0.8837 messages. In Overhead Ratio, routing Epidemics in all mobility have. Average Lowest Latency on Open Shortest Path Mobility based on 72.9538 ms.
Analisis Mobilitas Node Jaringan Nirkabel Pada Software Defined Wireless Network (SDWN) Putri Rizqia Hardein; Rakhmadhany Primananda; Achmad Basuki
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 (497.473 KB)

Abstract

Software Defined Network (SDN) has been developed over the last few years with the aim to simplify complexity in computer network. SDN's concept also developed to other kind of computer network including wireless network that really popular nowadays. The popularity of wireless network is caused by the simplicity and mobility that possible so there is no limitation for user's movement. But in the other hand, mobility also adds more challenges and really effected to the quality of wireless network performance. So, mobility is an important factor to considered when measuring wireless network performance. In this research, analysis of node mobility in SDN-wireless based or Software Defined Wireless Network (SDWN) has been done. The analysis is done by measuring network performance metrics specifically throughput, packet loss, and delay with Random Direction, Random Walk, and Random Way Point mobility model. The measurement is done at different velocity of node that is 5m/s, 10m/s, 15m/s, 20m/s, and 25m/s. The result shows that the highest throughput value 9.63 Mbps is gain in Random Direction at maximum velocity 25m/s, but it shows different result when the test is redone with 6.46 Mbps as highest throughput in Random Way Point that is caused by the instability of emulator. In the other hand, Random Way Point has the lowest packet loss 2116.2 packets at 25m/s and the lowest delay 51.056ms at 20m/s. The results show unstable value because of the emulator instability.
Pengembangan Interface Bluetooth Low Energy (BLE) Pada IoT Middleware Untuk Mendukung Network Interoperability Rasidy Cakra Pratama; Eko Sakti Pramukantoro; Achmad Basuki
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 (889.916 KB)

Abstract

In an earlier research developed an event-driven middleware with the ability to support the interoperability of various devices or sensors. From the results of the proposed middleware testing is able to overcome the problem of syntatic interoperability by providing gateway to communicate with IoT sensor device using MQTT and CoAP protocol, and able to communicate with other application using Websocket protocol. Reflecting on the previously offered solution to solve the interoperability problem, it is proposed another transmission line that is Bluetooth Low Energy (BLE) which will publish data to Middleware. To know the performance of BLE network transmission is tested with several parameters ie delay, bandwidth consumption, and CPU and memory usage. The test results show average CPU usage is 31% and memory usage is 5%. Delay received when using BLE transmission reaches 0.04523 seconds and when using BLE transmission along with WiFi transmission reach 0.032407248 seconds. In terms of consumption Bandwidth when using BLE transmissions reached 7786,6bits / sec and when using BLE Transmission along with WiFi Transmission doubled. From the research results show that Bluetooth Low Energy can be used to solve Interoperability problems.
Implementasi Multipath Routing Berbasis Algoritme DFS yang Dimodifikasi Uis Yudha Tri Wirawan; Widhi Yahya; Achmad Basuki
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 (1033.172 KB)

Abstract

Multipath routing is the routing technique that use some of the available paths. Multipath routing can reduce congestion on the network with load-balancing so that network traffic can be distributed to several available paths. It can be implemented with the concept of Software-Defined-Networking (SDN) which enable decoupling of control plane and data plane so as to facilitate the development of network applications. Here, we perform multipath routing implementation on the OpenFlow SDN and based on modified DFS and modified Djikstra as reference. The simulation results show that the system can perform multiple path search on a topology with the average response time of DFS algorithm is 612,7 ms. The average response time of modified-DFS algorithm is 632.6 ms and Dijkstra 325.6 ms. Number of iterations of the DFS algorithm requires 12694 iterations, modified-DFS requires 12860 iterations, and Dijkstra requires 800 iterations. The average execution time of DFS algorithm 0,0185 ms, modified DFS is 0,0258 ms, and modified Dijkstra 0,0005 ms. The result of throughput test shows that 50% of clients get throughput of 20 Mbps or less on modified-DFS algorithm. While at Dijkstra, as many as 50% of clients get throughput of 23 Mbps or less. The multipath test results show that load-balancing mechanism with group table still has unbalance distributed flow.
Implementasi Protokol 6LoWPAN Pada Purwarupa Wireless Sensor Nodes Faisal Akhmadi; Sabriansyah Rizqika Akbar; Achmad Basuki
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 (884.969 KB)

Abstract

Wireless Sensor Network appears as a network configuration that is able to provide solutions for a variety of applications in a difficult or unexpected situation. In general, there are two wireless communication standards used in WSN, namely IEEE 802.11 and IEEE 802.15.4. Each of these standards is able to present the use of Internet Protocol on WSN devices. The use of the IP protocol at WSN will bring the same benefits as IP on computer networks that have long been used, with various mechanisms and protocols that have been developed and used. In the absence of available blocks of IPv4 addresses, the use of IPv6 addresses must begin immediately. However, to bring IPv6 to WSN is hampered by limited resources. 6LoWPAN is here to enable the implementation of internet protocols to small devices. In this study, the design and implementation of wireless sensor prototypes using Raspberry Pi and MRF24J40MA as transceiver radio modules that use 6LoWPAN as the communication protocol is implemented. There are features added in this system that allow the sensor node to know the server's IP address without configuration. Also discussed about how to install MRF24J40MA so that it can be used for communication media using the 6LoWPAN protocol. The test results from this study indicate that overall, the system that has been made can run functionally and can use 6LoWPAN as a communication protocol.
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%.
Pengaruh Model Mobilitas Node Pada Protokol Routing AODV dalam MANET Laisa Ryry Pudja Mentari; Rakhmadhany Primananda; 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 (650.211 KB)

Abstract

Mobile Ad-Hoc Network (MANET) is one type of Ad-hoc Network that consist of independent wireless nodes. Each node can act as a relay and transmit a message to the other nodes that indirectly connected. In MANET, the nodes are moving dynamically so that it allows the use of different types of mobility model. However, the use of mobility models can lead into higher possibility of diconnection and higher routing failure. It could impact on the quality of network performance and became one of the important factor to considered when measuring the quality of network performance. There are some routing protocols that are used on MANET, one of which is Ad-Hoc on Demand Distance Vector (AODV). AODV is used because it is one of the most rapid adaptive routing protocols for dynamic link conditions. This research provided an analysis of the effect of node mobility on AODV in MANET topology using Network Simulator 3.25. Research was conducted using Random Waypoint (RWP) and Random Direction (RD) mobility model by measuring network performance metrics specifically packet delivery ratio (PDR), average end-to-end delay, and routing convergence time. Tests were conducted on both mobility models with scenario of 15, 25, 40, and 50 nodes variation and 750 m2 and 1250 m2 of simulation area. Measurement results show the highest PDR value is in RD with 92.27% in 750 m2 area. Meanwhile, the lowest end-to-end delay value is in RD with 25.93 ms in the ​​750 m2 area and the lowest routing convergence time value is in RD with 0.534 second on 750 m2 simulation area as well.
Co-Authors Adhitya Bhawiyuga Aditya Chamim Pratama Agung Wahyu Setio Budi Akbar, Sabriansyah Rizkika Akhmad Mukhtarom Al Aziiz Burhanudin Faidzin Labay Amalia Miftakhul Jannah Andi Yudiko Leonardo Solin Ariefanda Junediansyah Budi Darma Setiawan Cahyo Karya Basuki Candra Dewi Candra Dewi Dahnial Syauqy Dany Primanita Kartikasari Deron Liang Eko Laksono Eko Setiawan Eldyto Puspa Laksana Endah Octaviana Nasution Fabiansyah Raam Pontoh Fahmi Alfareza Faisal Akhmadi Faris Surya Akbar Fathan Abdurrahman Shani Amarta Putra Fitra Abdurrachman Bachtiar Fransiska Sisilia Mukti Friska Anggia Nurlita Sari Hans Romario Sitorus Ibrahim Ibrahim Imron Sazali Ismawati Nurjannah Jehn Ruey Jiang Jodi Prayoga Wahyudwi Jonathan Rovelano Huwae Kasyful Amron Kevin Jonathan Harnanta Khabban Sayyidi Razin Surya La Ode Muh. Fadlun Akbar Laisa Ryry Pudja Mentari Lutfi Fanani Maskur Purwiadi Maystya Tri Handono Moh Wildan Habibi Mohammad Zulfikar Mudjirahardjo, Panca Muhamad Miftahur Ridhoilah Muhamad Rizka Maulana Muhammad Aswin Muhammad Khairullah Harto Muhammad Rafi Fauzan Fathin Muhammad Syaifuddin Zuhri Muharrom Abdillah Onny Setyawati Panser Brigade Muhammad Pramukantoro, Eko Sakti Primantara Hari Trisnawan Putri Rizqia Hardein Raden Arief Setyawan Rakhmadhany Primananda Rasidy Cakra Pratama Refri Rifwan Daharmi Reza Andria Siregar Rifki Karim Ramadhan Rini Nur Hasanah Rizky Jelang Romadhondaru Rudi Hariyanto Sabriansyah Rizqika Akbar Sabriansyah Rizqika Akbar Sabriansyah Rizqika Akbar Shafira Aulia Indrarto Uis Yudha Tri Wirawan Widhi Yahya Widhi Yahya yuliana diah pristanti Zaky Abdussalam Zeddin Arief Zefanya Hermanta