Article Per Year (5 Year)
p-Index From 2021 - 2026
4.418
P-Index
This Author published in this journals
All Journal Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer
Primantara Hari Trisnawan
Universitas Brawijaya, Malang
Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering

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

Found 90 Documents
Search

 1   2   3   4   5 
Analisis Perbandingan Kinerja Multiprotocol Label Switching dengan Mekanisme Label Distribution Protocol dan Traffic Engineering Rahmat Yani; Primantara Hari Trisnawan; Mochammad Ali Fauzi
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 5 (2019): Mei 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

MPLS is a forwarding method to forward a package together with the label attached to each package, this process is called label switching. Routing protocol mechanism to distribute label on MPLS is divided into two types; those are Label Distribution Protocol (LDP) and Traffic Engineering (TE). LDP is a basic routing protocol used in MPLS network, using label switching. TE is a technique to manipulate network traffic to control the traffic load on the network. With the differences of MPLS mechanism using LDP and TE, indubitably the way of working and the performance of those routing protocol are also different. Graphical Network Simulator 3 (GNS 3) is employed to simulate MPLS using LDP and TE with Brawijaya University (UB) topology. Examination scenario are performed by sending package between 2 local networks outside the main network of UB's topology. The parameters are round trip delay to find out delivery speed and convergence time to know the speed of choosing the best route to reach destination when dead link occurs at delivery process. The purpose of this research is to compare the performance of MPLS using LDP and TE on the computer network routers. The results are, MPLS using TE has better performance because the delivery uses the explicit route on the tunnel. There's no need to search for designated router as used in MPLS LDP that makes the router looking for the best path when branching occurs. Using backup route also helps MPLS using TE to reduce convergence time when failure occurs at the delivery of the package.
Pendeteksian Serangan Black Hole terhadap Protokol Routing Ad Hoc On-Demand Distance Vector (AODV) pada Mobile Ad Hoc Network (MANET) Muhammad Taufiq Aryadi; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 7 (2019): Juli 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

MANET nodes are dynamic, which means that nodes can freely join and leave the network so that the formation of network topologies is dynamic. Each node can also behave abnormally like a black hole attack that can interfere with the routing process. Black hole attacks work by stating that they have the shortest route to the destination node to the source node. This will be very dangerous if the package sent is a package that contains important information so MANET needs a security mechanism to be able to detect and avoid black hole attacks. The detection system for black hole attacks consists of the process of searching for black holes and avoiding black hole routes. black hole search process is done by sending a RREQ message with a fake destination address. If there is a reply from the fake RREQ message, the RREP message sending node is marked as a black hole. The results of testing with a detection mechanism can find out the location of a black hole, it is proven by a mechanism that can overcome black holes in the scenario of the position of different black holes. In the test results can be seen when there is a black hole detection mechanism, the PDR value in the random walk movement of 94.164% can be greater than 0.00410408% without a detection mechanism. This happens because the data sent from the source node can reach more destination nodes than without the detection mechanism
Implementasi Intrusion Prevention System (IPS) berbasis Athena untuk Mencegah Serangan DDoS pada Arsitektur Software-Defined Network (SDN) Muhammad Farradhika Muntaha; Primantara Hari Trisnawan; Rakhmadhany Primananda
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 7 (2019): Juli 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Distributed Denial of Service (DDoS) are common and popular attacks on the SDN layer, namely the data plane. In this study, Athena-based Intrusion Prevention System (IPS) is applied to prevent and reduce the impact of DDoS attacks, especially TCP SYN flood and UDP flood. Two test scenarios were carried out to determine the IPS performance. The first scenario, comparing the impact of DDoS attacks without and with applied IPS to throughput and CPU usage on the controller. The second scenario, comparing the speed of the prevention function based on features in the detection model. The first test results show that IPS is able to prevent DDoS attacks as proven by the decrease in the throughput. The throughput when normal and IPS is applied against TCP SYN flood and UDP flood attacks for transmit parameters of 3956 pps, 4045 pps and 3919 pps while for receive parameters it is 4720 pps, 4793 pps and 4692 pps. IPS is also able to reduce the CPU load on the controller when those attacks are carried out each at 4.95% and 7.9%. The second test result concludes that the more appropriate and correct features are used for training, the faster IPS in recognizing the characteristics of dangerous hosts. This is proven by the average speed of prevention for each attack using 10 features each at 5.78 seconds and 5.99 seconds while the 5 features each at 12.42 seconds and 11.42 seconds. Moreover, IPS can be applied to hardware with specifications as in this study.
Pengaruh Data Video Streaming pada Kinerja Protokol Optimized Link State Routing (OLSR) menggunakan Teknologi Wireless Mesh Network Shindy Maria Ulfa; Rakhmadhany Primananda; Primantara Hari Trisnawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 7 (2019): Juli 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

In the past few years, streaming media has been enhanced within the wireless network, which is known as wireless mesh network. There is challenge if streaming connected through WMN, which is caused that streaming application requires broad bandwidth for high speed data within multi-hop media as well, thus produces packet value loss and delay significantly, while the streaming depends on packet loss and delay. That is why the purpose of this research is to figure the effect of streaming on optimized link state routing performance using wireless mesh network technology. As for the parameters used to know streaming quality in the network are; delay, packet loss, throughput and jitter. The testing has been done through some scenarios, which are; connection amongst client - server, streaming testing within 1 Mbps bandwidth, streaming testing within 2 Mbps bandwidth. The testing result of those scenarios deliver the highest throughput value as 928 kbps, value of the smallest delay is produced as 12.6 ms, the lowest jitter value as 0.0000098ms, produces packet loss value as 0.00018%. Based on the testing result, thus video streaming occurs on optimized link state routing performance using wireless mesh network technology shows a very good result.
Kinerja Protokol Routing AODV Terhadap Serangan Wormhole Pada Jaringan Mobile Ad Hoc Network (MANET) Ahmad Hanif AR; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 9 (2019): September 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

MANET is a wireless architecture network consisting of several mobile devices. It doesn't need any infrastructure or central access point like base station. MANET has 3 types of protocols, namely reactive routing protocol, proactive routing protocol, and hybrid routing protocol. AODV is an example of reactive routing protocol. MANET is still vulnerable to various forms of attacks which are capable to modify, harm, and delete the information data. One of the attacks that can occur in MANET is wormhole attack. Wormhole attack is an attack involving two or more attacking nodes connected in a tunnel, and manipulate the routing and also is able to do packet drop and selective packet drop. Testing is done with OMNET++ network simulator with a various scenarios like number of nodes, number of attacker nodes, and mobility nodes. Testing parameters includes end-to-end delay mean, throughput, packet delivery ratio (PDR), and packet loss. The results show that lowest value of PDR is 27.4% in 10 node with 2 attacker using gauss markov mobility scenario. The lowest value of packet loss is 46 from 2000 sent packet from source node in 30 node with 0 attacker using random waypoint mobility. The lowest mean of end-to-end delay is 8.5ms in 30 node with 4 attacker using random waypoint mobility.
Perbandingan Kinerja Protokol DSDV dan FSR Terhadap Model Node Tetap dan Node Bergerak Moh Irfan Haris; Primantara Hari Trisnawan; Rakhmadhany Primananda
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 9 (2019): September 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

MANET is a well-known self-configuring and infrastructure-less network. Each device connected to MANET is called a node, each of which has different characteristics in terms of mobility, which plays a role in the quality of a network. A node, when conveying a packet, requires routing process as a mechanism to determine the best path to let it reach its right destination. This research focused on comparing the performances of DSDV and FSR routing protocols when applied to both fixed and mobile nodes by testing three parameters, namely Routing Overhead, End-to-end Delay, and Convergence Time. Test scenarios were performed by varying the number of both moving nodes and non-moving nodes and varying the size of the packet conveyed. The results showed that the FSR protocol is more suitable to be applied in large-scale networks, with the values of convergence time, end to end delay, and routing overhead of 0.118 sec, 20.813 ms, and 22.748, respectively. Meanwhile, DSDV protocol is more suitable to be applied in small-scale networks, with the values of convergence time, end to end delay, and routing overhead of 0.1 sec, 31.607 ms, and 8.875, respectively. The results also indicated that the greater the packet conveyed the more significant the effect on the performance of a network because the data needs to be broken down into several segments, which are vulnerable to failure (Packet Loss).
Studi Komparasi Static ARP Entry dan Persistent Arping pada penanganan ARP Cache Poisoning Terbit Reformator; Primantara Hari Trisnawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 9 (2019): September 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

ARP (Address Resolution Protocol) is a protocol for addressing IP to the corresponding MAC Address in a local area network. Under normal circumstances a host on a local network will send ARP request packets that are broadcasted to obtain the MAC address of the destination host. When the host receives an ARP request addressed to it, the receiving host will send a unicast ARP reply packet to the sending host. Unfortunately, ARP does not provide an authentication mechanism for ARP replies intended for hosts that sent the packets. This enables every host on the network to fake ARP messages to poison the ARP cache of other hosts. ARP is vulnerable to attacks because it is a stateless protocol where ARP will accept and trust unsolicited replies so that spoof replies can be made to ARP requests. These spoofed replies can cause an ARP cache poisoning attack. ARP cache poisoning is an attack where an attacker sends a modified ARP packet to the local network. The modified packet causes the attacker's MAC address to be paired with the gateway's MAC address without the victim's knowledge that the entire traffic will pass through the attacker instead. In this study, handling of ARP cache poisoning attacks are done by analyzing the ARP packet traffic. ARP packages will be analyzed using wireshark and after a packet is considered to be a spoofed packet, prevention must be done. The types of treatment used in this study are Static ARP Entry and Persistent Arping. In this study, each type of treatment will be tested by measuring packet loss to the gateway when the ARP cache poisoning attack is in progress. The results between the two types of handling are an average of 0% packet loss when communicating to the gateway while an ARP cache poisoning attack is in progress using Static ARP Entry and an average of 53% packet loss while using Persistent Arping.
Perancangan Jaringan VoIP Berbasis SIP pada Wireless Mesh Network (WMN) menggunakan Routing Protocol OLSR Muhammad Afian Musthofa; Primantara Hari Trisnawan; Rakhmadhany Primananda
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 9 (2019): September 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Voice over Internet Protocol (VoIP) is a technology which allow a long distance communication and conversation through a computer network. However the quality of VoIP technology performance is very dependent on the computer network used as a conducting media to fasilitate long distance communication and conversation especially in a place which had a heavy terrain. Therefore to achive the best performance of VoIP, it requires a computer network technology to support its maximum performance. One of the computer network technology which becomes a mainstay and could be use for VoIP is a Wireless Mesh Network (WMN) which has various advantages over conventional computer network. On this research, a WMN is composed of 5 Laptops as main Nodes and some other are for user as a foundation to build the VoIP Network. A VoIP network built above WMN would be supported by Session Initiation Protocol (SIP) Server which is also be built on one of the Node with Linux platform. To discover the quality and performance of the VoIP network, a test sequence is required as well as the analysis to determine the Quality of Service (QoS) by using Delay, Packet Loss, and Jitter as parameter. The result of this research, which consider the outcome of the Delay, Packet Loss, and Jitter paramater showed a result which can be categorized as ‘satisfying' and suitable for implementation.
Perbandingan Kinerja Protokol Routing RIP (Routing Information Protocol) dan OSPF (Open Shortest Path First) Berbasis IPv6 Muhammad Affan Alvyan; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 10 (2019): Oktober 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Routing is the process of selecting the best route or route that must be passed so that packets get to the destination quickly. Most of the application of RIP and OSPF protocols on real networks and previous studies still use a lot of IPv4 networks, which we know is that the number of IPv4 address allocations in the world has decreased over the years. This study tries to use IPv6 addresses implemented in the RIP and OSPF routing protocols in the form of simulations in the Riverbed Modeler software to determine the performance of the two routing protocols by adding disconnections and recovery paths for sending data packets or failure recovery. The purpose of this study is to determine the best routing protocol in overcoming failure recovery from two IPv6-based RIP and OSPF routing protocols by comparing the performance of three parameters namely metric cost, convergence actvity, and routing traffic. The test results obtained from this study that the OSPFv3 routing protocol has a performance superior to RIPng in convergence activity and routing traffic. Difference in convergence activity speed of 8,59 seconds in scenario one and 3,39 seconds in scenario two. Difference in the average amount of traffic 153163,33 bps in scenario one and 109214,08 bps in scenario two. The conclusion from this study, that the best routing protocol in overcoming failure recovery is the OSPFv3 routing protocol. The metric cost parameter does not participate in determining the best routing protocol in overcoming failure recovery, because each routing protocol has its own algorithm in the routing process or has its own metric value in determining the best path that distinguishes between routing protocols.
Implementasi Protokol DSDV (Destination Sequenced Distance Vector) Pada Mobile Ad-Hoc Network Dengan Menggunakan Perangkat Berbasis nRF24L01 I Made Oka Semara Putra; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 10 (2019): Oktober 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

DSDV (Destination Sequenced Distance Vector) Protocol is one of the protocols which was used appropriately for Mobile Ad-Hoc Network, because it was proactive in order to solve the trait of the network which was changeable. However, in implementing process, the DSDV protocol was mostly used in simulator implementation, so that it resulted the study which was in ideal or perfect condition that would be problem when the protocol was implemented in daily life. In order to solve the problem, the researcher implemented the DSDV protocol on mobile ad-hoc network by using nRF24L01 based device in order to know the communication result of node on the real place where the study was done. From the study which was done , it showed that DSDV protocol can be implemented for every node, where every node can send broadcast messages to identify, for changing address each other, and in making routing table. Besides, it was also done the sending process in order to know the communication of node by using two testing scenarios; the first one was when the sender node needed another node in order to process the delivery and it showed the successful percentage which was 70%. The next was the second scenario was when the destination node moved and went into the sender's node range and it showed the successful percentage which was 80%. The result of the implementation which was done showed that the environment which was used as the testing environment affected the communication from node of DSDV protocol.
Co-Authors Abraham Arya Satyana Achmad Basuki Adam Kukuh Kurniawan Adhitya Bhawiyuga Aditya Bhawiyuga Ahmad Ali Hamdan Ahmad Hanif AR Al Aziiz Burhanudin Faidzin Labay Andi Mohammad Thareq Akbar Andre Hadi Saputra Andre Rizal Sinaga Angger Ramadhan Anisa Permatasari Anita Sumiati Antarif Ekadhia Cahyadi Anugerah Wijaya ari kusyanti Arie Prayogo Pangestu Aris Adi Utomo Arya Seta Bagaswara Asika Ayu Wandira Audi Azzura Falaq Ayub Firdhouzi Bagus Prasetya Chandra Yogi Adhitama Dahru Wildan Pradanaputra Damianus Dewa Pratama Daniel H. Simatupang Danny Candra Rumantyo Dany Primanita Kartikasari Dicky Satriawan Dimas Agung Rizky Ananta Egi Muliandri Eki Renaldi Faiz Amzadkhan Fajar Faris Naufal Al Farros Fariz Andri Bachtiar Fariz Andri Bakhtiar Fathan Abdurrahman Shani Amarta Putra Firza Nur Hibatullah Halimah Septya Mikayla Hans Romario Sitorus Hasan Sabiq Hilman Nihri Hilmy Riadika I Dewa Gede Ardana Pucanganom I Made Oka Semara Putra Ignatius Suryo Wicaksono Imam Nurhidayat Imam Utomo Julio Firdaus Irawan Kasyful Amron Kesit Budi Kusumo Khalid Hamzah Haza Al Hamami Lulus Bagos Hermawan M. Ali Fauzi Mahadika Putra Pratama Mahardika Yuristyawan Putra Miftaqul Novandi Moh Irfan Haris Mohamad Deltaviyahya Mohamad Lutfi Mohammad Rizky Dwisaputra Muhammad Affan Alvyan Muhammad Afian Musthofa Muhammad Alif Bahari Muhammad Farradhika Muntaha Muhammad Fattah Na'im Pang Ripto Muhammad Ichwan Pradana Muhammad Nurusshobah Muhammad Ramiz Kamal Muhammad Ryan Firmansyah Muhammad Sholeh Muhammad Syaifuddin FP Muhammad Taufiq Aryadi Nuril Huda Pahlevi Muhammad Pramukantoro, Eko Sakti Prasetyo Eko Yulianto Putu Ade Arta Kusuma Putra Suparta Ragil Setyo Utomo Rahmat Yani Raihan Radito Rakhmadani Primananda Rakhmadhani Primananda Rakhmadhany Primananda Ravy Agistya Alkamaly Rayza Arfian Reza Andri Siregar Reza Andria Siregar Rezky Hadiwiriyanto Rino Erik Sanrio Risqi Nuril Aimah Rizky Haryandi Rahman Roy Marten Sirait Ryan Eko Listyanto Sabriansyah Rizqika Akbar Sandy Prasetyo Shindy Maria Ulfa Swasti Paramita Terbit Reformator Thelemanica Wicaksana Tommy Bona Hamonangan Sitorus Widhi Yahya Wildan Aulia Rachman Yohanes Heryka Febriarso Zeddin Arief