Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal JURNAL TEKNOLOGI INFORMASI The Indonesian Journal of Computer Science
Wijayanto, Febri
Unknown Affiliation
Computer Science & IT Electrical & Electronics Engineering Engineering

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

Found 2 Documents
Search

 1 
Analisis Static Malware Menggunakan Algoritma Random Forest Machine Learning Wijayanto, Febri; Putranto, Hasvid Dwi; Toriq, Farhan; Bhayangkara, Dimas Satrya
JURNAL TEKNOLOGI INFORMASI Vol 9, No 2 (2023): Jurnal Teknologi Informasi
Publisher : Universitas Respati Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52643/jti.v9i2.2850

Abstract

Malware is a malicious software program that aims to damage or steal data from a victim's system. Malware analysis is needed to determine the performance of the malware. Static analysis was used for feature extraction from a total of 10 PEfiles, 5 malware files and 5 benign files. The random forest machine learning algorithm obtained an accuracy of 99.99%.
Analisis Perbandingan Routing Loops antara OSPF dan EIGRP Menggunakan Spanning Tree Protocol Wijayanto, Febri; Santoso, Banu
The Indonesian Journal of Computer Science Vol. 13 No. 5 (2024): The Indonesian Journal of Computer Science (IJCS)
Publisher : AI Society & STMIK Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33022/ijcs.v13i5.4342

Abstract

This study analyzes the quality of service (QoS) in routing loops between Open Shortest Path First (OSPF) and Enhanced Interior Gateway Routing Protocol (EIGRP) using Spanning Tree Protocol (STP) to prevent loops in network topology. OSPF uses a link-state algorithm, while EIGRP combines link-state and distance vector algorithms. Routing loops can cause network congestion and communication disruptions. Four routing scenarios on IPv6 were tested. Results show that EIGRP without STP yields a throughput of 93.973 Bytes with a delay of 0.147ms, while OSPF without STP yields 94.056 Bytes with a delay of 0.180ms. EIGRP with STP produces a throughput of 93.922 Bytes with a delay of 0.150ms, and OSPF with STP produces 94.056 Bytes. STP implementation improves OSPF delay but does not significantly affect throughput. No packet loss occurred in all scenarios. OSPF without STP had the lowest jitter at 0.011ms, and EIGRP with STP had the highest at 0.0124ms. This study shows that the choice of routing protocol and STP implementation affects IPv6 network performance, depending on throughput or delay priorities.
Co-Authors Banu Santoso Bhayangkara, Dimas Satrya Putranto, Hasvid Dwi Toriq, Farhan