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

 2   3   4   5   6 
Perbandingan Kinerja Protokol ZRP (Zone Routing Protocol) dan HWMP (Hybrid Wireless Mesh Protocol) pada MANET (Mobile Ad hoc Network) Miftaqul Novandi; 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 (432.337 KB)

Abstract

MANET is a dynamic wireless network, because each node can move freely so the topology network often changes unpredictably. Conditions in the changing topology due to an effect on the performance of the routing protocol used on MANET. A mobile device in MANET that is implemented as a mobile node can be a tablet, laptop and smartphone. MANET's routing protocols have several types, namely reactive, proactive and hybrid (a combination of reactive and proactive routing protocols). Previous research on the performance of the ZRP and HWMP protocols which is hybrid routing protocols, using the scope of the WMN (Wireless Mesh Network). WMN has a range of a devices that‘s not wide and topology that is used in a static state. This research using the scope of MANET, focusing on user devices, mobility built without infrastructure, and ad-hoc capabilities. The topology in a network that moves dynamically and the implementation in a broad scope is able to influence the performance of the ZRP and HWMP protocols as the routing protocol that we want to simulate in this study. With this routing protocol changes will be observed that occur based on testing parameters such as throughput, packet delivery ratio (PDR), normalized routing load, end-to-end delay and convergence time. The scenario test is done using static and dynamic nodes, and Network Simulator 2 (NS-2) as a test simulation. The simulation results that have been obtained are concluded that ZRP routing protocol is more dominant for the five test parameters carried out in the dynamic topology scope, while for the static topology is more dominated by HWMP.
Analisis Perbandingan Load Balancing Berbasis Algoritma Never Queue dan Destination Hashing pada IPv6 Mohamad Deltaviyahya; Primantara Hari Trisnawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 11 (2019): November 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The use of IPv4 in addressing is a consideration of the continued growth of the internet, so IPv4 needs to provide even more addresses. IPv6 is designed to overcome the weaknesses of IPv4. This research is to find out the performance of load balancing based on Never Queue and Destination Hashing algorithm on IPv6. The performance of a website that has a management server is called load balancing. Load balancing is a system for loading large loads that cannot be carried out by a single server. Algorithms in load balancing generally use Round Roubin and Least Connection. This study uses the Never Queue (NQ) and Destination Hashing (DH) algorithm. NQ algorithm has the advantage of having a supporting algorithm. If the queue request is not resolved, then use the algorithm. Recent Delays to calculate the fewest connection delays. DH algorithm has advantages, contains a hash table that contains the destination address of the server along with its services. The parameter used is Time per Request, with the aim of obtaining website services from the time needed to make the request to the response. Seen from the results Time per Request given to each different number of clients can be deduced from the algorithm Never Queued with 2 and 3 servers giving a better Time per Request result in all of clients.
Implementasi Protokol Anchor-Based Street and Traffic Aware Routing (A-Star) menggunakan Intersection Node pada Vehicular Ad-Hoc Network (VANET) Danny Candra Rumantyo; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 11 (2019): November 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Vehicular Ad-Hoc Network (VANET) is a wireless network technology that supports vehicle communication. The problems and research focus on VANET are generally related to the selection of effective routing protocols. Topology-based protocols in the Mobile Ad-Hoc Network (MANET) still have limitations because they are vulnerable to fast node movement and dynamic topology changes but are still used on VANET. Position-based protocol removes these limitations, so it is the most appropriate protocol used in the VANET environment. In this study the routing protocol used is Anchor-Based Street and Traffic Aware Routing (A-STAR). The A-STAR protocol is included in the position-based protocol category and has a mechanism of action based on intersections on the road. This study uses Simulation of Urban Mobility (SUMO) and Network Simulator 3 (NS-3) to simulate the A-STAR protocol based on a real map. The test scenario that will be used to test the protocol is the number of nodes, node speed, and the number of node intersections. The results of the test are analysis metrics consisting of packet delivery ratio, end-to-end delay, routing overhead, convergence time, and euclidean distance. The test results of the three scenarios show the average value of packet delivery ratio of 85.1%, end-to-end delay of 93.28ms, routing overhead of 873.88 packets, convergence time of 1.46s, and euclidean distances of 104 , 64m.
Analisis Perbandingan Kinerja Protokol Routing OSPF, RIP, EIGRP, dan IS-IS Pahlevi Muhammad; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 11 (2019): November 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

To communicate with each other, routers need routing protocols for sending information. There are several routing protocols used to send information, OSPF, RIP, EIGRP, and IS-IS. Each of these protocols has different algorithms in determining the best path for sending information, this of course makes a difference in the workings and performance of the routing protocol. Therefore it is necessary to analyze the best protocol in a condition in order to obtain the best performance. This study uses the Graphical Network Simulator 3 (GNS-3) application to simulate the actual network using a Mesh topology with 4 routers, 6 routers, and 8 routers. The parameters used as a measurement of the performance of the routing protocol are convergence time and round trip time. The smaller the value of the test parameters obtained from the routing protocol, the better the improved protocol.
Simulasi dan Evaluasi Kinerja Protokol Distance Routing Effect Algorithm for Mobility (DREAM) Pada Vehicular Ad-hoc Network (VANET) Untuk Komunikasi Kendaraan dengan Infrastruktur Imam Utomo; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 12 (2019): Desember 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Ad-Hoc Vehicle (VANET) is a network for wireless communication on vehicles that allows one node to another node to communicate with or without infrastructure. In VANET there are two modes of communication Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I). This paper is focused on discussing vehicle communication with infrastructure (V2I). In designing of VANET several problems arise, one of which is the selection of a routing protocol that matches the criteria and characteristics of the VANET network. In this paper, the protocol used is the Distance Routing Effect Algorithm for Mobility (DREAM), the protocol which will be simulated and analyzed based on a test-parameters that includes vehicles and variations of the RSU to establish a DREAM protocol suitable for use in VANET environments, DREAM protocol was chosen because the data transmission mechanism is related to the Road Side Unit (RSU). The simulation is performed using NS-2 for protocol simulation and SUMO is used for map simulation. The results of the DREAM protocol simulation will be analyzed based on test parameters namely packet delivery ratio (PDR), end-to-end delays, routing overhead and convergence The test results show the average value of PDR is 97,515%, the average value of end-to-end delay is 46,273 ms, the average value of routing overhead is 31,872 and the average value of convergence has is 548,207 ms..
Analisis Perbandingan Kinerja Protokol Routing RIP dan Protokol Routing IS-IS pada IPv4 dan IPv6 Rino Erik Sanrio; Primantara Hari Trisnawan; Fariz Andri Bachtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 1 (2020): Januari 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

RIP and IS-IS are routing protocols with round trip times and the fastest convergence time among other dynamic routing protocols. Workflow and routing protocol performance is affected by the algorithm used. GNS3 is a simulator used for simulating routing protocols with mesh topologies. This study uses Wireshark to record packets on the network. This routing protocol is implemented using IPv4 and IPv6 addressing. Tests carried out using mesh topology 4 routers and 6 routers. Convergence time and round-trip time are the performance parameters that are tested. This study aims to determine the convergence process when the path is broken. The results of the research are the IS-IS routing protocol that uses IPv4 addressing has the fastest convergence time with a convergence time of 0 ms, while the RIP routing protocol is 1 ms. This is because the algorithm used makes the IS-IS router has a database that connects the network topology.
Implementasi Socket Programming dalam Penyesuaian Ukuran Paket pada Jaringan IPv6 Kesit Budi Kusumo; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 2 (2020): Februari 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

In IPv6 (Internet Protocol Version 6), fragmentation is only allowed on the end host side. As a result, IPv6 packets can experience potential failures in delivery. The potential failure is caused by two things. First, the packet size exceeds the MTU (Maximum Transmission Unit) value. Second, the router is configured by the network administrator to filter ICMPv6 Packet Too Big packets. Existing solutions are PMTUD (Path Maximum Transmission Unit Discovery), PLPMTUD (Packetization Layer Path Maximum Transmission Unit Discovery), and MSS (Maximum Segment Size) Clamping. However, these three solutions cannot be used in UDP (User Datagram Protocol) based communication and not all operating systems activate these features. Therefore, this research presents a solution by implementing socket programming through the case of audio streaming. With socket programming, research results show communication can take place well. This has been tested through several scenarios. In the first scenario, the results of the experiment without ICMPv6 Packet Too Big filtration and uniform MTU values are smooth communication with a small average packet loss below one percent. In the second scenario, the test results accompanied by ICMPv6 Packet Too Big filtration and MTU values are not uniformed are the same as in scenario one. The difference is that there is a pause as a result of the congestion control mechanism by the DCCP (Datagram Congestion Control Protocol) streaming protocol and limitation on socket buffer.
Kinerja Protokol Distance Routing Effect Algorithm for Mobility (DREAM) Terhadap Serangan Wormhole pada Mobile Ad-hoc Network (MANET) Prasetyo Eko Yulianto; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 2 (2020): Februari 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Mobile Ad-hoc Network (MANET) is a network consisting of a collection of mobile nodes that function as routers for data transmission. The node communicates without relying on a fixed network infrastructure. One of the routing protocols on the network is DREAM which has characteristics in finding paths using the routing table. Mobile nodes are free to join and leave the networks at any times, thus leaving MANET vulnerable to attack. One of them is a wormhole attack that creates a link between two or more of nodes that affects routing performance. The study will be conducted using NS-2.35 to see the performance of the DREAM protocol in the presence of a wormhole attack based on the scenario of the number of nodes and variation of the wormhole node with a random waypoint mobility and random direction model. Parameters for testing include packet delivery ratio (PDR), end-to-end delay, routing overhead, and convergence time. The results show that increasing the number of node variations can affect evaluation metrics, while increasing the number of wormhole nodes is more stable. Testing with 3 pairs of wormhole nodes get the lowest packet delivery ratio of 11.975 % on 10 nodes with random direction mobility. The highest end-to-end delay result is 446,544 ms at 50 nodes with random direction mobility. The highest routing overhead result is 33.216% at 50 nodes with random waypoint mobility, and the highest convergence time result is 183,459 s at 50 nodes with random waypoint mobility.
Implementasi Load Balancing Web Server dengan Algoritma Source IP Hash pada Software Defined Network (SDN) Anita Sumiati; Primantara Hari Trisnawan; Mochammad Ali Fauzi
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 3 (2020): Maret 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Software Defined Networking (SDN) is a network architecture that separates the control plane from the data plane. SDN network architecture divides incoming requests to be given to a server. SDN uses OpenFlow version 1.3 as a protocol and load balancing to distribute the load on two or even more balanced network connections. Load balancing has an algorithm that is use to distribute requests to each server. There were several algorithms that have been used before, one of them is the least traffic algorithm. This research uses the Source IP Hash algorithm, and Ryu as the controller that functions to allocate the server by doing a hash on the source IP address. This algorithm is tested and analyzed its performance on, response time, throughput, and packet loss. The throughput value of the source IP hash algorithm reaches 206 mbps while the least traffic algorithm is 106 mbps. Packet Loss that occured in the source IP hash algorithm is 0% while the least traffic algorithm experienced packet loss with the category high as much as 4.009%. From the two results of throughput and packet loss tested, it is concluded that the source IP hash algorithm handles requests from clients better than least traffic. The Source IP Hash algorithm could allocated the same source IP address to the same server, while the least traffic algorithm must selected the server by making a loop based on low traffic.
Mekanisme Load Balancing Server Menggunakan Metode Naive Bayes dengan Agen Psutils pada Software Defined Network Aris Adi Utomo; Primantara Hari Trisnawan; Rakhmadhani Primananda
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 4 (2020): April 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The performance of the server is heavily influenced by the resources of those servers both include memory, disk and CPU. Server can experience overload when at one time get load traffic that exceeds its capability. To handle it can use the Load Balancing system using the Resource usage parameters of the server. This research will implement Load Balancing using the Naive Bayes algorithm with parameters including memory, disk and cpu. The built-in system will be applied to the Software Defined Network architecture by using the Fuzzy algorithm as a comparator. Testing was conducted using two Low text and text High test scenarios and three rates in each of the 25, 50 and 100 rate. The test parameters used include traffic distribution, throughput, response time, memory usage and CPU usage. From the test results obtained by Naive Bayes algorithm in all scenarios and test rates on Throughput, Response time, CPU Usage and Memory Usage parameters showed better results when compared to the Fuzzy algorithm. Average rating for CPU Usage testing for Low text and High text and Memory Usage for Low text and High text is 77.6% and 80% and 26.9% and 50.3%.
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