Claim Missing Document
Check
Articles

Perbandingan Performa Reverse Proxy Caching Nginx dan Varnish Pada Web Server Apache Muhammad Luthfi; Mahendra Data; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 4 (2018): April 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Web servers are now an essential part of both developing and newly started companies. Apache is the web application server with the most revenue in the world. Apache, however, has some drawbacks, one of which is that Apache is become slower when serving many requests continuously. One way to improve the performance of Apache web servers is by reverse proxy cahing. Of the many reverese proxy caching, Nginx and Varnish have the highest reputation. To find out the resource management and quality of service revese proxy caching Nginx and Varnish on the Apache web server will be tested by sending a number of requests to the web server. As a result, both servers with reverse proxy caching can outperform the Apache web server without reverse proxy caching on CPU usage and latency in the first 3 tests, whereas on Apache server load testing without reverse proxy caching it provides smaller latecy than Apache servers without revese Proxy cacahing. The comparison between Varnish reverse proxy caching and Nginx paired on the Apache web server, giving the Apache server results with reverse proxy caching Varnish performs better than the Apache server with Nginx reverse proxy caching.
Implementasi Load Balancer Berdasarkan Server Status Pada Arsitektur Software Defined Network (SDN) Lalu Fani Islahul Ardy; Aditya Bhawiyuga; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 5 (2018): Mei 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

One of the problems in computer network is load balancing. The emergence of Software Defined Network (SDN) architecture is expected to be a new paradigm in addressing issues related to load balancing on traditional networks. The flexibility gained from separation between control plane and data plane on the SDN architecture makes it feasible to develop technologies that hard to implement on traditional networks. In this research, a load balancing algorithm is developed based on the SDN architechture. An SDN controller that is connected to an SDN switch will sends messages to each server based on the specified time interval to get the CPU and memory utilization and response time from each server. Those parameters are used to determine the load of each server. The SDN switch will then split request from client to server with smallest load. Load balancing algorithm's performance will then be compared to similar algorithms on server clusters with same specification (homogeneous) and server clusters with different specifications (heterogeneous). The result found that the proposed algorithm is able to distribute requests from clients to servers based on status of the server and perform better than similar algorithms on server clusters with different spesifications (heterogeneous).
Analisis Perbandingan Kinerja Protokol Websocket dengan Protokol SSE pada Teknologi Push Notification Panser Brigade Muhammad; Widhi Yahya; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 6 (2018): Juni 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Push notification technology allows users (clients) to get information periodically. Information submitted by push notification in the form of notifications such as on social network or news sites. There are many technologies that can be applied to notification delivery. One of them is notification delivery using Websocket protocol and Server-Sent Events (SSE). The Websocket protocol implements full-duplex communication so that either the server or client can send and receive data simultaneously. While the SSE protocol implements half-duplex communication so that the client can only receive data sent server periodically. This study was conducted to compare the performance of Websocket protocol with SSE related to method of delivery of both protocols on push notification technology. Both protocols will be implemented and tested based on predetermined scenarios. The results obtained are the average delay and CPU usage in SSE protocol is smaller than Websocket protocol.
Analisis Perbandingan Sistem Manajemen Bandwidth Berbasis Class-Based Queue Dan Hierarchical Token Bucket Untuk Jaringan Komputer Bagas Prawira Adji Wisesa; Aswin Suharsono; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 6 (2018): Juni 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Voice over Internet Protocol (VoIP) service, which is delay-sensitive and File Transfer Protocol (FTP) services with delay-tolerant. With bandwidth management, bandwidth can be set according to the needs of the application. In addition, bandwidth management can also lend out bandwidth has been allocated in accordance with priorities in order to optimize the use of bandwidth. Class-Based Queue (CBQ) method and Hierarchical Token Bucket (HTB) method is bandwidth management mechanism based on the priority class that can be run in the ubuntu operating system. This study applies the Class-Based Queue (CBQ) method and Hierarchical Token Bucket (HTB) method on different types of traffic such as VoIP and FTP. Parameters of Quality of Service (QoS), which include delay, jitter and throughput. From the results of testing, Hierarchical Token Bucket (HTB) method more appropriately applied to VoIP traffic and also FTP. QoS parameters, in accordance with the value obtained when using the VoIP Hierarchical Token Bucket (HTB) method without priority i.e. delay at 14.35 ms, jitter and throughput ms 0.25 and 0.15 MBit/s. While at FTP i.e. delay 31.93 ms and 0.37 MBit/s throughput.
Pengembangan Sistem Penyimpanan Data Berbasis MongoDB dan GridFS Untuk Menyimpan Data Yang Beragam Dari Node Sensor Gabreil Arganata; Eko Sakti Pramukantoro; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 7 (2018): Juli 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Internet of things (IoT) plays an important role in the development of the Internet today. The implementation, which resulted into IoT's heterogeneous data from variety of sensors, and it will keep getting bigger everyday. The examples of heterogeneous data are temperature, humidity, and image file. Along with that, problem of choosing which method to store the data into data storage appear. Based on that problem, the solution that's possible to be applied is NoSQL method. Therefore, in this research a media storing system using MongoDB and GridFS (NoSQL database) based are proposed to answer those challenges. Furthermore, an Internet Gateway Device is proposed to connect an existing middleware with data center. The solution are wrapped inside a framework which also include a web service to ease the request and response process. The system performance test has been done in few aspect such as functional, scalability, response time of saving and retrieving data, also analysis performance of data storage. The result of the functional test is that data storage system, which has been developed, is running well based on its function in storing variety of data into data storage. Based on those results, this system can become a solution for IoT data storage problem
Perbandingan Kinerja RouterOS Mikrotik dan Zeroshell pada Mekanisme Load Balancing Serta Failover Ardy Frayogi; Widhi Yahya; Raden Arief Setiawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 7 (2018): Juli 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The Internet becomes an important need in society. The problem that is often faced by the public to access the internet is a slow connection and unstable internet service provider. Multiconnection is one solution that can be used to make access to the Internet network for better. Multiconnnection requires a technique called load balancing and failover. It is used to maximize throughput so that access to the internet becomes more stable and faster. Implementing load balancing and failover requires routerOS to be able to control incoming packets. RouterOS that features load balancing and failover are Mikrotik and Zeroshell. In this study will apply and compare the performance of load balancing and failover that is applied to router Mikrotik and Zeroshell. The load balancing method used in Mikrotik is nth and in Zeroshell uses round-robin method. Based on the results of the study concluded both routerOS can run very well with load balancing and failover. The result of load balancing performance applied to MikroTik using nth method has higher throughput value compared to the throughput value applied to Zeroshell load balancing. Performance results on failover tests applied to Mikrotik have a smaller delay value compared to the failover test applied to Zeroshell.
Perancangan dan Implementasi Kelas Virtual FILKOM Universitas Brawijaya dengan Memanfaatkan Teknologi WebRTC (Web Real-Time Communication) Rahadiyan Yuniar Rahmanda; Eko Sakti Pramukantoro; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 7 (2018): Juli 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Streaming and video conferencing technology can be utilized to implement distance learning technology such as virtual class. One of platforms that can be used in developing a virtual class is WebRTC. This research intends to design and implement virtual class system for FILKOM UB by utilizing WebRTC, which offers solutions to distance learning methods that lecturers and students can do whenever and wherever through the web in real-time. 3 main features of this virtual class are a broadcast feature that allow lecturer to do broadcasting to students, share file feature that allow lecturer to send files to students, and text-chat feature that allow lecturer and students can send chat messages. This research perform functionality testing and results that all of system requirements have been fulfilled in accordance with the analysis of system requirements. This research also perform system network performance testing especially on broadcast feature to know quality of service (QoS) from system. This test results show that highest average delay value on audio delivery is 143.17 ms and video is 198.82 ms. Highest average jitter value on audio delivery is 240.51 ms and video is 134.67 ms. Average packet loss on audio or video delivery is well below 1%.
Perbandingan Kinerja Routing Multi Copy Dan Routing First Contact Dengan Stationary Relay Node Pada Delay Tolerant Network (DTN) Poltak G. Hutajulu; Widhi Yahya; Eko Sakti Pramukantoro
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 7 (2018): Juli 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Internet has become the most widely used as media presentations and information exchange. The information exchange can be accessed by using adequate connectivity. Some places still have low connectivity and some place do not have connectivity like Semeru mountain climbing areas, because of that the exchange of information will be difficult to access due to high delay and loss rate. The problem can be solved with Delay Tolerant Network (DTN). DTN is a network concept that is tolerant of delay and disconnected connections on a network. In this study using DTN network simulation process on The ONE simulator to compare the performance of DTN routing protocol with the addition of Stationary Relay Node. Routing types used are routing First Contact, Epidemic, MaxProp, ProPHET, and Spray and Wait with Semeru climbing scenarios. The results of this research show that the highest delivery probability is 0,5388 with 200 node and 15 Stationary Relay Node by Spray and Wait routing. The highest overhead ratio is 6.7484 with 50 nodes and 20 stationary relay nodes by Spray and routing. Routing First Contact before and after the addition of Stationary Relay Node has a higher average latency rate. The lowest average latency is 7491,9710 with 200 nodes and 15 Stationary Relay Nodes by MaxProp routing.
High Availability Controller Software Defined Network Menggunakan Heartbeat dan DRBD Maskur Purwiadi; Widhi Yahya; Achmad Basuki
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 (1099.118 KB)

Abstract

Network model architecture that used nowadays are difficult to apply a new protocol because it depends upon vendor, so it appeared a concept that manage network systemperformance through software named Software Defined Network. SDN separating data-plane and control-plane in network devices such as router and switch, so that programming network devices may be done centrally through a controller.A controller manage forwarding table switch which forwarding the flow of communication package.If a controller goes offlinea switch not be able to forwarding the flow of communication package from a device to other devices. So it needs high availabillity controller mechanism to be able to maintain the availability of a controller so the communication package can be arrive. High availability controller can be done by mechanism failover use Heartbeat and DRBD.Testing in this research done with planned downtime methods. The test results that obtained from the average downtime of POX controller when failover process is 23 seconds, and 59,6 seconds when failback process, while Opendaylight controller took time 195 seconds for failover process and 219 seconds for faillback. This method is a good enough, where the more features run in a controller the longer time downtime will produced.
Implementasi Routing Berbasis Algoritme Dijkstra Pada Software Defined Networking Menggunakan Kontroler Open Network Operating System Faizal Ramadhan; Rakhmadhany Primananda; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 7 (2018): Juli 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Software Defined Networking is a new paradigm that emerging in networking industry to solve today's computer network problem such as the difficult configuration because it used low-level configuration as well as limited visual devices. By using the SDN network, the network will have advantages such as easy to developing and experimenting of new protocols, easy to manage, and ease the network to adapt when there is infrastructure changes. Controller is an important part of the SDN network, because the controller has function to control the login in SDN network. ONOS is a controller that offers the advantage delivering high-availablity, scalable, and bring performace as good as carrier grade class. Dijkstra's shortest path algorithm is one of the routing algorithms. Dijkstra's shortest path routing performance on SDN network using ONOS controller produces lantecy time 0,092 ms using geoDistance function and latency time 0,097 using linkMetric function. This concluded latency time will increase along with the lenght the path used for communicate between hosts. Meanwhile the performance test result of ONOS controller while running Dijkstra algorithm as well as responding to fail path on the network link resulted that ONOS controller provide good performance on the network that requires infrastructure with combination of 20 switches and 40 hosts, and the average convergence time that ONOS needed to build new path is 1,405s.
Co-Authors Achmad Basuki Adhitya Bhawiyuga Adi Iman Utama Aditya Bhawiyuga Afredy Carlo Sembiring Agung Nugroho Ahmad Naufal Romiz Ahmad Rizal Muttaqin Andhika Dwitama Putra Andika Kurniawan Andreas Frederius Aprilia Kartika Sriastunti Aprillia Arum Pratiwi Ardy Frayogi ari kusyanti Arief Budi Setiawan Arnandha Hadi Pranata Aswin Suharsono Bagas Prawira Adji Wisesa Bagus Prasetyo Bagus Satria Wiguna Bhaskara Vito Tarigan Dany Primanita Kartikasari Dany Rahmana Dea Asmara Gita Delarta Tok Adin Dimas Dwi Radhityo Dimas Setiawan Afis Doni Hadiyansyah Enggar Saka Dirgantara Faizal Ramadhan Fariz Andri Bakhtiar Florensius Tri Putra Simamora Frondy Fernanda Ferdianto Gabreil Arganata Galeh Prehandayana Guntur Wahyu Pamungkas Hafidz Rizal Hafizhul Karim Hasbi Razzak Heru Nurwarsito Hilkya Dwima Palembangan Ibrahim Attamimi Imam Santoso Ismiarta Aknuranda Kasyful Amron Lalu Fani Islahul Ardy Landika Hari Suganda Lucky Ronny Chandra Negara M. Ali Fauzi Mahendra Data Maskur Purwiadi Moch. Wahyu Imam Santosa Mochammad Hannats Hanafi Mochammad Hannats Hanafi Ichsan Moh Wahyudi Putra Mohamad Rexa Mei Bella Mohammad Hafidzar Rakhman Muhammad Aji Wibowo Muhammad Luthfi Muhammad Rifqi Muzaki Muhammad Sholeh Muharrom Abdillah Niki Yuniar Wicaksono Nur Fauzi Panser Brigade Muhammad Poltak G. Hutajulu Pramukantoro, Eko Sakti Primantara Hari Trisnawan Rahadiyan Yuniar Rahmanda Rakhmadhany Primananda Ratih Kartika Dewi Reza Andria Siregar Rian Bayu Pambudi Risailin Dwi Jaka Fauzi Riski Julianto Romy Dwi Andika Manullang Sabriansyah Rizqika Akbar Sandy Ramadhan Wijaya Steven Urbani Tista Pamungkas Ragil Alit Uis Yudha Tri Wirawan Ulfa Khoirul Azizah Wijaya Kurniawan Yasin Rizqi Afandi Zavero Brillianata Abilovani Zefanya Hermanta