Article Per Year (5 Year)
p-Index From 2020 - 2025
4.142
P-Index
This Author published in this journals
All Journal Jurnal Teknologi Informasi dan Ilmu Komputer Jurnal Inspiration Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Jurnal ULTIMA Computing KOPEMAS
Dany Primanita Kartikasari
Fakultas Ilmu Komputer, Universitas Brawijaya
Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering Social Sciences Other

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

Found 49 Documents
Search

 1   2   3   4   5 
Implementasi Arsitektur Web Server Cluster Menggunakan Single Board Computer untuk Menunjang Kebutuhan High Availability System Roisul Setiawan; Dany Primanita Kartikasari; Bayu Rahayudi
Jurnal Teknologi Informasi dan Ilmu Komputer Vol 8 No 2: April 2021
Publisher : Fakultas Ilmu Komputer, Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25126/jtiik.2021824512

Abstract

Untuk mewujudkan ketahanan pangan, diperlukan mekanisme pengumpulan data secara real-time dari produsen  bahan pangan, pendisitribusi bahan pangan sampai pengolah bahan pangan. Namun tidak semua organisasi yang berkecimpung dalam distribusi pangan memiliki infrastruktur sistem informasi yang cukup baik. Untuk mengatasi kendala infrastruktur, penelitian ini mengusulkan untuk membangun arsitektur web server cluster yang dapat menunjang kebutuhan high availability system menggunakan single board computer.  Komponen arsitektur terdiri dari dua tier yaitu: frontend dan backend. Untuk menjamin kehandalan sistem, arsitektur  yang diusulkan didukung dengan komponen load balancing, mekanisme failover dan replikasi database. Sistem telah diuji berasarkan kebutuhan fungsional dan kebutuhan non-fungsional yang sudah didefinisikan sesuai kebutuhan organisasi. Dari hasil pengujian, tingkat availabilitas yang dihasilkan sebesar 95.83%. AbstractTo achieve food security, a real-time data collection mechanism is needed from food producers, food distribution to food processing. However, not all organizations involved in food distribution have adequate information system infrastructure. To overcome infrastructure constraints, this study proposes to build a web server cluster architecture that can support the needs of a high availability system using a single board computer. The architectural component consists of two tiers, namely: frontend and backend. To ensure system reliability, the proposed architecture is supported by load balancing components, failover mechanisms, and database replication. The system has been tested based on functional requirements and non-functional requirements that have been defined according to organizational requirements. From the test results, the resulting availability level is 95.83%.
Optimasi Penjadwalan Mata Kuliah Menggunakan Metode Algoritma Genetika dengan Teknik Tournament Selection Yuslena Sari; Muhammad Alkaff; Eka Setya Wijaya; Syarifah Soraya; Dany Primanita Kartikasari
Jurnal Teknologi Informasi dan Ilmu Komputer Vol 6 No 1: Februari 2019
Publisher : Fakultas Ilmu Komputer, Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (3621.855 KB) | DOI: 10.25126/jtiik.2019611262

Abstract

AbstrakBagi sebuah perguruan tinggi, penjadwalan perkuliahan merupakan suatu kegiatan yang sangat penting   untuk   dapat   terlaksananya   proses belajar mengajar   yang   baik.  Dimana   dalam   proses  belajar mengajar dapat dilakukan oleh semua pihak yang terkait, bukan hanya bagi dosen yang mengajar, tetapi juga bagi mahasiswa yang mengambil mata kuliah. Dalam penyusunan jadwal, ada beberapa variabel yang mempengaruhi yaitu: ruangan yang tersedia, jumlah mata kuliah yang diselenggarakan, waktu yang ada dan ketersediaan dosen yang mengajar. Oleh karena itu tujuan dari penelitian ini adalah merancang suatu sistem yang dapat membuat atau menyusun   jadwal    perkulihaan    secara  teroptimasi. Metode dalam proses pembuatan jadwal perkuliahan secara otomatis pada penelitian ini menggunakan metode algoritma genetika dengan teknik seleksi turnamen. hasil pengujian sistem dapat memberikan kemudahan dan kecepatan kepada user atau Program Studi Teknologi Informasi dalam proses pembuatan atau penyusunan jadwal untuk    perkuliahan,    yaitu hanya diperlukan waktu sekitar 14,7 menit dibandingkan dengan proses manual yang memerlukan waktu sekitar 2 (dua) hari.AbstractFor a college, the university course timetabling is is an activity that’s very important for the implementation of good teaching and learning process. In  teaching  and  learning  process  can be done    by    all    related    parties,   not    only    for Lecturers who teach, but also for students who take the course. In the preparation of the schedule, there are several variables that affect the: the available space, the number of courses held, the time available and the availability of lecturers  who  teach. Therefore, the  purpose  of this research is to design a system that can create or arrange optimization schedule optimally. Methods in the process of making university course   timetabling   automatically   in   this study using genetic algorithm method with tournament selection.
Evaluasi Kinerja Video Streaming Mpeg Dash Menggunakan Protokol Transport Multipath TCP Dany Primanita Kartikasari; Tohari Ahmad; Waskitho Wibisono
Inspiration: Jurnal Teknologi Informasi dan Komunikasi Vol 7, No 2 (2017): Jurnal Inspiration Volume 7 Issue 2
Publisher : STMIK AKBA

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35585/inspir.v7i2.2443

Abstract

Tulisan ini menyampaikan hasil penelitian tentang efek penggunaan Multipath TCP sebagai protokol transport dalam menayangkan video streaming adaptif menggunakan MPEG DASH. Penelitian ini menguji efek penerapan mekanisme congestion control OLIA dengan penjadwal default pada video streaming, untuk dibandingkan dengan penayangan video streaming . Dari hasil penelitian didapatkan bahwa untuk kondisi jaringan yang stabil, TCP memberikan hasil yang lebih baik serta waktu unduh yang lebih kecil dibandingkan dengan MPTCP. Namun demikian dalam kondisi bandwidth yang berfluktuasi dan berbentuk anak tangga, MPTCP memberikan performa yang lebih baik dalam hal pengisian buffer dan dalam parameter waktu unduh.
Implementation Of Lossy Compression Method For Storage Saving On Fog Computing Rachmat Indra Permadi; Dany Primanita Kartikasari; Fariz Andri Bakhtiar
Ultima Computing : Jurnal Sistem Komputer Vol 13 No 2 (2021): Ultima Computing : Jurnal Sistem Komputer
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31937/sk.v13i2.2214

Abstract

Video surveillance is a technology that uses a camera as an image receiver or input and a monitor/TV as an image producer or output to covers in certain areas. In its application, video surveillance monitors an area/place using a camera that has been installed in that place. The camera periodically records the situation that occurs in a place which is then sent to the virtual storage room via the internet network which is then displayed on the monitor/TV. However, video surveillance has a weakness, the data/video generated is so large that the storage space becomes full. Based on the experiments that have been carried out previously, the concept of fog computing is applied which is connected to a CCTV camera installed in a room for 24 hours. From these experiments, the results obtained are quite large recordings of 4 GB. To reduce the use of excessive storage space, resource management is carried out using the lossy compression method. In this study, the concept of fog computing is applied to compress video using the lossy compression method. The lossy compression methods used in this study include; H.263, H.264, and MJPEG. In this study, a video with the H.263 codec was produced which resulted in an average video size of 57,282 KB. While the H.264 and MJPEG codecs produce an average video size of 166,350 KB and 303,555 KB.
Implementasi Constrained Application Protocol (CoAP) pada Sistem Pengamatan Kelembaban Tanah Yosef Febri Wiryawan; Dany Primanita Kartikasari; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 8 (2018): Agustus 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Recently, technology has been developed to facilitate human life in every aspects including agriculture. Implementation of technology in agriculture is still left behind for example in terms of observation soil moisture. Based on concept of Wireless Sensor Network (WSN) we can make a suitable network architecture to solve the problem. Wireless Sensor Network (WSN) is one of the emerging technologies which combine sensors and tiny embedded devices over a wireless communication medium. The aim of this study is how to make a reliable communication for the system. To accomplish our objectives, we implemented a lighweight protocol as a web transfer protocol named Constrained Application Protocol (CoAP) for the system. To collect the soil moisture data we integrated Microcontroller Wemos D1 and sensor YL-69 to perform as a sensor node, it sends sensing data to the server with bluetooth module HC-05. Then servers and clients will exchange data wirelessly using the CoAP protocol. To see the performance of the CoAP protocol, we tested the data exchanging that occurs between server and client in several scenarios. The test result revealed there is a significant increase of delay in payload size more than 64 bytes because of process blockwise mechanism in CoAP protocol. In addition, distance can also increase the delay in data transmission process.
Analisis Kinerja Protokol Routing pada Arsitektur Delay Tolerant Network Terhadap Beberapa Pola Pergerakan Hafidz Rizal; Widhi Yahya; Dany Primanita Kartikasari
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 8 (2018): Agustus 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Delay Tolerant Network (DTN) is a network does not matter for delay, disruption, and disconnection from the internet. The continuous movement for send a massege will produce movement patterns, like patterns of random, scheduled, and patterned movements. This research to know performance of routing protocol of Prophet, Maxprop, Epidemic, and Spray And Wait with addition of node and speed on random, scheduled and patterned movement. The One is used for simulation and OpenJUMP for the make a map. The results form the addition of node and speed is probability delivery and overhead rasio has increased and average latency is decreased. The protocol routing maxprop has better performance in the pattern of random movement and patterned movement, because on the addition of nodes and speed produce the value on delivery probability is 63% and 55% in random movement, 62% and 59% patterned movement, average latency is 33% and 31% in random movement, 32% and 32% patterned movement, and overhead ratio is 83% and 78% in random movement, 83% and 88% patterned movement. Then the pattern of scheduled movements protocol routing spray and wait has better performance, because on the addition of nodes and speed produce the value on average latency is 37% and 44%, overhead ratio is 4% and 8%, and delivery probability is 41% and 40%.
Implementasi K-Shortest Path Routing pada Jaringan Software Defined Network Romy Dwi Andika Manullang; Widhi Yahya; Dany Primanita Kartikasari
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 (785.001 KB)

Abstract

Software Defined Network (SDN) is a network modeling separating control plane and data plane. Network routing is part of SDN that give interest for the research. The most commonly used routing algorithm today is the single path routing algorithm. This algorithm uses only one path as the data transmission medium. This will reduced network performance known as network congestion. In this study we implemented Yen K-Shortest Path as routing algorithm. These algorithm will search for as many K lines as the data transmission medium. The Yen K-shortest path algorithm will minimize network congestion. These algorithms has been implemented using Mininet emulator and Ryu controller in two topology. The tests performed to measure the performance of the algorithm include convergence time, throughput, packet loss. The data obtained in the test using the Yen K-Shortest Path algorithm compared to data obtained using Dijkstra algorithm with the same test method. And there is a test to see the success of the algorithm for using more than one path on multipath testing. In the convergence time test, the Yen K-Shortest Path algorithm gets an average of 0.01962 seconds for the first topology, and 0.02409 seconds for the second topology. Based on the results of throughput testing, the Yen K-Shortest Path algorithm outperformed Dijkstra's algorithm with the highest throughput increase reaching 176.01% larger. For packet loss test results, Yen K-Shortest Path is also superior because it has fewer packet loss than Dijkstra algorithm.
Implementasi Link Fast-Failover Pada Multipath Routing Jaringan Software-Defined Network Muhammad Aji Wibowo; Widhi Yahya; Dany Primanita Kartikasari
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 (827.96 KB)

Abstract

Software-defined network is a concept of computer network approach where the control plane is separated by data plane. The communication between the data plane controller uses the OpenFlow protocol. In an SDN architecture it often happens to have interference such as failure link. in the latest openflow protocol there is a group type that overcomes the interruption of the link is using a fast-failover mechanism. Tests conducted to measure the performance of the system include testing functionality, response time and packet loss. The results of the test obtained from this study are able to search the path at the time before the link down and after the link down. At the time of link 1 in down in topology has a response time with an average of 0.38-0.681 ms and in link 2 has an average of 0.272 - 0.549 ms. When the link is down, the lost packet until it finds the new path can be known the value of packet loss. packet loss obtained from the simulation has an average of 0.423% -0.636%.
Analisis Mekanisme Keamanan Antara TLS/SSL Dan Crypto Pada Komunikasi IoT Middleware Dengan Subscriber Berbasis Protokol HTTP Deny Hari Prasetya Dewa; Eko Sakti Pramukantoro; Dany Primanita Kartikasari
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 (697.874 KB)

Abstract

There is a security hole in message delivery on a middleware where messages are still in plain text, causing data confidentiality to be insecure. Eavesdropping activities will be very easy to do if a security mechanism is not implemented immediately. Based on the problem, implemented end-to-end security mechanism using TLS / SSL and Crypto. The use of security mechanisms not only secures the network, but also affects the performance of the system. The process of encryption and decryption slows down middleware performance. This study focuses on knowing how the impact of TLS / SSL and Crypto security mechanisms, especially AES-256 on data security and middleware performance. Before the security mechanism is implemented, the data contained on the network is very readable. After both security mechanisms are implemented, the data cannot be known again because the contents have been encrypted. TLS / SSL provides stronger security by using certificate exchanges as an authentication system. Both methods installed are capable of securing the system but both affect the performance of middleware. Both security mechanisms have no significant effect on CPU and memory usage. AES-256 produces better values ​​on packet loss parameters, with a value of 1%. While TLS / SSL is superior in parameter delay and jitter, with value 0.089008423 sec and 0.003208877 sec.
Implementasi Load Balancing untuk Kontroler Software Defined Network Adi Iman Utama; Widhi Yahya; Dany Primanita Kartikasari
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 (496.464 KB)

Abstract

The development of increasingly complex needs of traditional networks will affect the high cost of investment and hardware maintenance so that required solutions to these developments by using Software Defined Network (SDN). SDN is a concept of separation between control plane and data plane on network devices such as routers and switches, whereas in traditional networks the control plane and data plane are combined into one. Using a single controller on the SDN concept obtained a latency value with an average of 1000 to 1900 responses / second and throughput with an average of 50 to 300 flow / second, the value decreased performance when the number of switches connected in the network environment increased. In this research apply load balancing to do the load sharing on some controller that connected so that performance of each controller can run with maximal. The controller used in this research is POX while to implement load balancing controller will be used HAproxy on server computer. The test results show that as the increasing number of controllers with load balancing will provide better latency and throughput results from the use of 3 controllers obtained the latency value with an average of 2000 to 3300 responses / second and throughput with an average of 70 to 4300 flow / second, but as the number of controllers increases load of server load balancing will increase seen from CPU and Memory Usage.
Co-Authors Achmad Basuki Achmad Brahmantyo Arundaya Subianto Adharul Muttaqin Adhitya Bhawiyuga Adi Iman Utama Aditya Bhawiyuga Adytya Tri Syahrul Alim Andika Kurniawan Apriyanto J.P.L Tobing ari kusyanti Attabik Muhammad Amrillah Awit Priharsiwi Ayub Firdhouzi Bayu Rahayudi Cahyo Karya Basuki Darma Wahyu R Prameswara Deny Hari Prasetya Dewa Dhimas Satriawan Utama Dhiyaan Khansa Afifah Dian Eka Ratnawati Dwiyan Ramadhan Dharmanzah Dyah Ayu Ocky Mawardani Farah Nabilla Putri Irzan Fariz Andri Bakhtiar Farouq Alamsyah Fathan Muhammad Fathi Nur Azzam Fikry Juan Aulia Hafidz Rizal Indra Lesmana Putra Indriyana Liliasari Rahma Yusvi Jodi Chris Jordan Sihombing Lius Alviando Luqman Hakim Yumnun Made Ayu Gayatri Widhiastuti Mahardika Putra Utama Mahendra Data Muhamad Ralfi Akbar Muhammad Aji Wibowo Muhammad Alkaff Muhammad Nursodik Wicaksono Pramukantoro, Eko Sakti Primantara Hari Trisnawan R. Moch Makruf Puja Pradana Rachmat Indra Permadi Rakhmadhany Primananda Rexy Marten Reza Andria Siregar Richad Gilang Wisduanto Riza Anisul Fu'ad Roisul Setiawan Romy Dwi Andika Manullang Roy Marten Sirait Rozali Syahputra Sukma Alamsyah Budianto Syarifah Soraya Syifa Namira Neztigaty Tasrahmiati Istiqomah Tohari Ahmad Veny Charnita Br Ginting Waskitho Wibisono Widhi Yahya Wijaya, Eka Setya Yanuar Alfianus Yosephan Raharjo Yefta Kristiyanto Yosef Febri Wiryawan Yuni Kilawati Yunita Maimunah Yuslena Sari, Yuslena