Claim Missing Document
Check
Articles

Pengaruh Model Mobilitas Terhadap Konsumsi Energi Protokol Routing Optimized Link State Routing (OLSR) Pada Mobile Ad Hoc Network (MANET) Hans Romario Sitorus; Primantara Hari Trisnawan; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 1 (2021): Januari 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Mobile ad hoc Network (MANET) is a dynamic communication network that can exchange information wirelessly by mobile nodes. This study is using Optimized Link State Routing (OLSR) as a protocol routing which is a proactive routing protocol. The main characteristic of a proactive routing protocol is a protocol that continually updates toward network topology changes by exchanging topology information at each node continuosly. This causes the proactive protocol requires high power. The mobility of mobile node on MANET also has several models including Random Waypoint, Random Walk, and Random Direction. With the nature of OLSR routing protocol that requires high power and the characteristic of mobile nodes on MANET networks that have limited power, it is necessary to know the influence of mobility models on energy consumption to build a MANET network with OLSR routing protocol efficiently. The testing scenarios in this study use two scenarios, which are based on the mobility models and based on the number of nodes. In the total energy consumption scenario with 20, 40, 60, 80, and 100 number of nodes and with Random Waypoint, Random Walk and Random Direction mobility models shows that the total energy consumption on Random Waypoint mobility has a significant difference compared to other mobility models. This is indicated by the percentage of total residual energy on Random Waypoint is 17.48% while Random Direction is 21.36% and Random Walk is 21.05%. In the average energy consumption scenario, each mobility model has increased the average value of energy consumption as the number of nodes increases with the number of nodes scenario of 20, 40, 60, 80, and 100 nodes. But in the Random Waypoint model, there is a decrease in average value of energy consumption from 791.941523 Joule at 40 number of nodes to 766.603226 Joule at 60 number of nodes. Whereas for the Random Walk and Random Direction mobility models, there was no decrease in the average value in any number of nodes scenario.
Implementasi Algoritme C5.0 Untuk Klasifikasi Serangan DDoS Endah Octaviana Nasution; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 1 (2021): Januari 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

DDoS is a computer attack that is still trend for attackers. This attack is the most effective way to block the victim's resources by sending a large number of packets. Over time, DDoS attacks have grown and varied. Therefore, a DDoS attack detection that is adaptive to various types of attacks is needed. Machine learning-based IDS is a detection system that classify data using a specific algorithm. This study classified DDoS attacks use the C5.0 algorithm. This method can treat continuous variables and attribute selection based on the highest information gain as the parent for the next node. C5.0 has an additional function, namely boosting to improve accuracy. The dataset used is CICDDo2019. This data was developed by University of New Brunswick in 2019. The data used were 56279 instances including 25133 DDoS attacks and 31146 instances of normal network traffic. The results of testing the accuracy, precision, and recall evaluation of the C5.0 algorithm are 98.38%, 98.39%, and 98.37% and the required running time is 16.84 seconds.
Analisis Perbandingan Kinerja Metode Single Homing dan Multihoming dengan Protokol Border Gateway Protocol (BGP) Fathan Abdurrahman Shani Amarta Putra; Primantara Hari Trisnawan; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 3 (2021): Maret 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

A network is said to be single homing if a network has only one connection or one outlet that is connected to one ISP, while a network is said to be multihoming if it has many outlines using one or more different service providers. BGP is a routing protocol used for interconnection between autonomous systems and can facilitate single homing or multihoming needs on the Internet. This study applies single homing and multihoming methods and evaluates the performance in the Eve-NG simulator environment. The evaluation is based on the routing convergence time, delay, and packet loss. In the QoS test, the results for the average delay on the network using single homing is at 501.366 ms meanwhile on the multihoming network the average result was 501.128 ms. In the QoS test, there was no packet loss because all packets were sent and received in the test. In the test for the convergence time of the single homing network, the convergance time cannot be calculated because when the network is disconnected, the network cannot be reconnected due to the unavailiability of a redundant link. meanwhile the average convergence time for multihoming is at 158.4 seconds for the test.
Deteksi Serangan DDoS pada Jaringan Berbasis SDN dengan Klasifikasi Random Forest Muhammad Khairullah Harto; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 4 (2021): April 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Along with the development of network technology, threats related to the network are also growing, one of which is DDoS (Distributed Denial of Service). The increasingly advanced and affordable network infrastructure makes DDoS happen more and more. From year to year, there is a significant increase in the number of DDoS attack cases. Therefore, it is still necessary to study various algorithms for classifying data in networks that constitute deep DDoS. The SDN network was chosen because it has a simple implementation and does not require a lot of resources because of the information about the network topology and the controller that will be built using Ryu. The method used is the Random Forest algorithm as a method for classifying DDoS attacks. After conducting the research, the researchers found that Random Forest performed well in detecting DDoS attacks. The accuracy is quite high around 90% with an average detection time of 0.3 seconds.
Implementasi Algoritme A* Pada Software Defined Network Untuk Mencari Jalur Terpendek Al Aziiz Burhanudin Faidzin Labay; Primantara Hari Trisnawan; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 6 (2021): Juni 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Software Defined Network (SDN) is a new networking paradigm that decouples or separates the control plane from the data plane. The Software Defined Network makes it easy to develop and experiment new protocols, easy to manage and adapting in infrastructure changes. The A* algorithm implemented in ONOS Controller with Abilene topology works well. Using A* Algorithm can produce the shortest path that is calculated from the real distance with an average time to make a path is 15,766 ms. The results of testing is showing that the average value of throughput and packet loss at 5 clients is 100.2 Mbps and packet loss is 2.1%, for 7 clients is 92.5 Mbps with packet loss of 3.9% and 72.06 Mbps with 7.5% packet loss for 9 clients. The average delay value is 0.081 ms. The A* Algorithm implemented in the ONOS Controller also works well when there is a fail link with an average convergence time value is 20,773 ms.
Implementasi Monitoring Platform untuk Microservice Architecture menggunakan Elastic Stack (Studi Kasus : Alterra Indonesia) Khabban Sayyidi Razin Surya; Adhitya Bhawiyuga; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 4 (2022): April 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Microservice architecture is one of the architectures that can be used in software development, by making every business process in the application into a microservice. Microservices have advantages such as easy scalability, extensibility with different technologies, and increased software agility. However, in developing using microservices there are challenges regarding how to know the behavior of each running microservice, this challenge is felt when there are too many microservices running. The monitoring platform is the answer to these challenges, the monitoring platform will help to provide visibility to the running microservices. The monitoring platform will help show the workload of each microservice, incoming and outgoing network packets, and record event logs for each microservice. As the number of running microservices grows, new challenges will emerge for the monitoring platform. The monitoring platform must be able to receive data from various microservices with various forms of data. The researcher tries to solve this problem by implementing a monitoring platform for microservice architecture using elastic stack. This monitoring platform will be built on several servers with elastic stack components installed and each server has its own function. The monitoring platform will centralize all microservices data on a single platform, and the platform provides a single dashboard to unify the performance of all microservices without the need to move to another dashboard. To ensure this platform can receive a lot of data from all microservices and can always be accessed at any time, several tests were carried out. Fault tolerance testing to ensure the platform will continue to run even if one server is down. Load balancer testing will be carried out to ensure that the platform load is evenly distributed on each server. snapshot and restore to ensure data is stored for a long time, latency testing to ensure data sent to the elastic stack does not take a long time, and lastly is confidential testing to ensure only authorized users can ensure certain monitoring data.
Pengembangan Platform Hands-on Lab untuk Manajemen Identitas dan Akses menggunakan Teknologi Virtualisasi berbasis Container Fabiansyah Raam Pontoh; Achmad Basuki; Adhitya Bhawiyuga
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 6 (2022): Juni 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Hands-on Lab is a lab that is used to provide an environment that is able to provide learners with practical experiences. Providing a hands-on lab environment for practical deepening of understanding of the Identity and Access Management coursework requires a virtualized computing and networking environment that can separate resources for each learner. The choice of platform and technology for computing and virtual networks is necessary for the effectiveness of activities in the hands-on lab. This final project implements a hands-on lab with container-based virtualization technology. The container was chosen because of the characteristics of being lightweight and fast to build. The developed hands-on lab also needs to have an automated assessment system so that it can be used independently by learners. The implementation of the hands-on lab platform in this final project requires two main components, namely: a website lab and a hands-on lab server. The website lab is used for interaction between learner and the hands-on lab server, then the hands-on lab server is used as a place for the hands-on lab container to run. The main components of the hands-on lab of identity and access management in this final project consist of six software that has these functions: managing identity and access management, managing databases, testing web, performing LDAP access, sharing container's terminal, and as a proxy for sharing container's terminal. Communication of the lab website and hands-on lab server for container management is done through Secure Shell. Learners access to hands-on lab learning activities using a terminal container that is shared from the hands-on lab server to the lab website. The results of the implementation based on the functional testing aspect show that the hands-on lab can run according to its function in providing containers, stopping containers, and conducting automatic assessments according to the needs of learning materials. Non-functional tests will also be performed to calculate hands-on lab behavior when performing automated assessments, running, and stopping containers. In addition, testing is also carried out to determine the resource utilization required by a hands-on lab. The non-functional test results show that time behavior is quite responsive and resource utilization is quite good with 1.03% CPU and 13.78% RAM utilization.
Implementasi Lab Virtual berbasis Teknologi Kontainer Multi Klaster dengan Orkestrator Kubernetes Mohammad Zulfikar; Adhitya Bhawiyuga; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 6 (2022): Juni 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In field of information technology education, provisioning virtual lab is very important to provide practical experience to learners. This has made many universities develop their own virtual labs. However, in practice, each university can have limited or excess of resources. This makes the existing virtual lab run inefficiently. This research proposes the implementation of virtual lab based on multi-cluster container technology with Kubernetes orchestrator to create virtual lab system that allows universities to share resources. The implementation of the virtual lab system is carried out by implementing three main components: orchestrator cluster, university cluster, the Rancher multi-cluster management platform as the university cluster controller. The functional evaluation results in adding new university clusters, displaying university clusters information, running container applications, exposing application within the cluster to outside of the cluster, adding new users, managing access rights of these users, and manages the resource usage of the running container are all well-functioning. The non-functional test results shows that the system can handle requests from 1000 users simultaneously with 32.84% CPU and 77.60% Memory utilization. Meanwhile, when handling 10000 users, the system can handle 79.5% of the total requests with 83.18% CPU and 77.06% Memory utilization. From the test results, the system in this study is proven to have good scalability to handle access by many learners and can be a solution for a container-based virtual lab system.
Penerapan Algoritme Prim dan Floyd-Warshall sebagai Algoritme Routing pada Arsitektur Software Defined Network Ariefanda Junediansyah; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 6 (2022): Juni 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Software Defined Network is a concept of computer network approach where the control system of data flow is separated from other devices. The control system or controller is responsible for defining the network, managing availability issues, traffic data rates, routing and forwarding and others. Routing is the process of determining the route or path taken by packets as they flow from sender to receiver. In finding the shortest route, a routing algorithm is needed. In this study, the routing algorithms used are Floyd-Warshall and Prim. In general, Prim's algorithm is often used to solve Minimum Spanning Tree problems on graphs to minimize tree spans or reduce the number of branches. In this study Prim's algorithm is used to find the shortest route, then compared with the Floyd-Warshall algorithm. Both algorithms are implemented in a hybrid topology using a mininet emulator and a Ryu controller. Determination of the path required path cost. Cost determination is based on the results of the calculation for the reference bandwidth of 1000 Mbps and link bandwidth using three types of capacity sizes, namely 1000 Mbps, 100 Mbps and 10 Mbps. Then tested with the parameters of convergence time and recovery time as many as 30 trials on each algorithm. From the test results, it is found that the application of Prim's algorithm finds the shortest route faster and finds a new route faster when a link failure occurs.
Penerapan Elastic Stack sebagai Platform Visualisasi dan Analisis Trafik pada Jaringan Riset dan Edukasi Muhammad Rafi Fauzan Fathin; Achmad Basuki; Adhitya Bhawiyuga
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 6 (2022): Juni 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Network monitoring is an essential part of a computer network, where monitoring functions monitor the status and activity of network devices. To effectively ensure the security and quality of the network, monitoring is needed to provide detailed network traffic information. However, in general, many network monitoring uses the Simple Network Management Protocol (SNMP) because it has become the industry standard in network monitoring. In the case of network monitoring with wide coverage, such as IDREN, using the SNMP protocol is considered by the manager to be less effective, because it only provides minimal data visibility and measures bandwidth usage. This final project proposes a monitoring platform or visualization and analysis of research and education network traffic using Elastic Stack because it can display detailed network traffic data in various appearance. Implementation of network traffic visualization and analysis platform in this research requires two main components: a router with the Netflow protocol and an Elastic Stack Server. Routers that already have the Netflow protocol are used as gateways for incoming and outgoing network traffic, collecting metadata on the IP network and sending it to the Netflow Collector. Meanwhile, Elastic Stack is used instead of Netflow Collector using the Logstash system, metadata storage and analysis using the Elasticsearch system, and visualization with the help of Kibana. The test results show that the visualization and analysis platform implemented runs according to its function in providing detailed network traffic data in various visualization displays. Based on the test, the performance of Elastic Stack as a network traffic visualization and analysis platform can manage data from 97 B to 110 MB per 30 minutes and display that data in various visualizations and analyses in real-time.
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