Application caching strategy based on in-memory using Redis server to accelerate relational data access

Zulfa, Mulki Indana; Fadli, Ari; Wardhana, Arief Wisnu

doi:10.14710/jtsiskom.8.2.2020.157-163

Cited by 9 publications

(10 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Database clustering dipadukan dengan Redis sebagai aplikasi caching. Zulfa memaparkan dalam penelitiannya bahwa aplikasi caching tersebut mempercepat akses data relasional [18]. Redis sebagai cache digunakan untuk meringankan kinerja dari server dengan cara menyimpan sementara konten di memori agar dapat digunakan kembali pada request yang sama.…”

Section: Tinjauan Pustakaunclassified

Infrastruktur High-Available Learning Management System Universitas Menggunakan Least-Connected Load Balancer

Ramadhan¹,

Wulandari

2022

JMASIF

View full text Add to dashboard Cite

IPB University berdiri sejak tahun 1963 sebagai salah satu perguruan tinggi ternama di Bogor. Pandemi membuat civitas akademik IPB University untuk melakukan kegiatan belajar mengajar jarak jauh. Namun, berjalannya Learning Management System (LMS) belum cukup untuk melayani ribuan pengguna tanpa kesalahan. High-availability menjadi desain lingkungan produksi esensial untuk meminimalisir kegagalan karena ada sistem lain yang dapat menggantikan sehingga proses produksi tidak terganggu. Untuk mewujudkan konsep high-availability pada LMS, diperlukan perencanaan skema sistem server yang matang. Penelitian ini mengimplementasikan konsep high-availability pada server LMS terdistribusi dengan menggunakan load balancing, web clustering, dan juga database clustering. Implementasi menggunakan serangkaian server basis data, server web, server NFS, server load balancing web, dan juga server load balancing basis data. Sistem terimplementasi telah diuji berdasarkan kebutuhan fungsional yang sesuai. Pengujian yang dilakukan ditinjau dari pengamatan terhadap waktu respon dan juga performa LMS. Hasil pengujian menunjukkan bahwa LMS telah mengaplikasikan konsep high-availability ketika terjadi suatu kesalahan pada salah satu server web. Pengujian juga menunjukkan bahwa kinerja server web telah seimbang menggunakan leastconnected load balancer. Ketika salah satu server web tidak dapat diakses, maka server web yang lain mengambil request client sehingga sistem tetap dapat berjalan.

show abstract

Section: Tinjauan Pustakaunclassified

Infrastruktur High-Available Learning Management System Universitas Menggunakan Least-Connected Load Balancer

Ramadhan¹,

Wulandari

2022

JMASIF

View full text Add to dashboard Cite

show abstract

“…Zou and Chen (2016) proposed the hybrid queue (HQ) framework as a distributed caching method. This framework proposed predictive dead-time (PDE) as a cache replacement method when the cache is full.…”

Section: Caching Strategymentioning

confidence: 99%

“…However, if a Web developer wants to develop Web-based applications with user-specific patterns, involve many join queries and more shareable content, integrating Web caching and Web prefetching must be chosen. Web developers must periodically look at the effects of combining such two techniques, such as the use of excessive bandwidth and CPU overhead (Prakash and Kovoor, 2016; Zulfa et al , 2020).…”

Section: Caching Strategy Guidelinementioning

confidence: 99%

Caching strategy for Web application – a systematic literature review

Zulfa

Hartanto

Permanasari

2020

IJWIS

Self Cite

View full text Add to dashboard Cite

Purpose Internet users and Web-based applications continue to grow every day. The response time on a Web application really determines the convenience of its users. Caching Web content is one strategy that can be used to speed up response time. This strategy is divided into three main techniques, namely, Web caching, Web prefetching and application-level caching. The purpose of this paper is to put forward a literature review of caching strategy research that can be used in Web-based applications. Design/methodology/approach The methods used in this paper were as follows: determined the review method, conducted a review process, pros and cons analysis and explained conclusions. The review method is carried out by searching literature from leading journals and conferences. The first search process starts by determining keywords related to caching strategies. To limit the latest literature in accordance with current developments in website technology, search results are limited to the past 10 years, in English only and related to computer science only. Findings Note in advance that Web caching and Web prefetching are slightly overlapping techniques because they have the same goal of reducing latency on the user’s side. But actually, the two techniques are motivated by different basic mechanisms. Web caching uses the basic mechanism of cache replacement or the algorithm to change cache objects in memory when the cache capacity is full, whereas Web prefetching uses the basic mechanism of predicting cache objects that can be accessed in the future. This paper also contributes practical guidelines for choosing the appropriate caching strategy for Web-based applications. Originality/value This paper conducts a state-of-the art review of caching strategies that can be used in Web applications. Exclusively, this paper presents taxonomy, pros and cons of selected research and discusses data sets that are often used in caching strategy research. This paper also provides another contribution, namely, practical instructions for Web developers to decide the caching strategy.

show abstract

“…Multiple transactions on the edge network often request the same data. If this happens continuously for a long time, it will increase the workload of the edge network, which impacts the slow response time on the users side [9].…”

Section: Introductionmentioning

confidence: 99%

Improving Cached Data Offloading Optimization Based on Enhanced Hybrid Ant Colony Genetic Algorithm

et al. 2022

Self Cite

View full text Add to dashboard Cite

The data offloading mechanism is one of the critical strategies needed on edge networks to help cloud computing network performance in serving user data requests. This strategy should be optimized to prevent network congestion. The main problem of this strategy is how to assess the priority of cached data so that the cache memory buffer capacity can be optimized. In this paper, we modeled the cached data offloading strategy using the Knapsack Problem 0/1 (KP01) approach. Several researchers proposed a metaheuristic algorithm to solve cached data offloading using the KP01 approach. Meta-heuristic algorithms require a reliable solution selection method to find the global optimal solution. However, some studies still use the roulette wheel selection method to provide a set of solutions. The RWS method has a weakness of imbalance the particle fitness with its cumulative probability. Therefore, it is difficult to find the global optimal solution. This study proposed a nested-Roulette Wheel Selection (nRWS) method on hybrid Ant Colony Optimization (ACO) and Genetic Algorithm (GA) to address the cached data offloading optimization using the KP01 approach. The simulation results show that the proposed nRWS method is able to find the global optimal solution in terms of the value of the objective function and hit ratio which is superior to previous studies.

show abstract

Application caching strategy based on in-memory using Redis server to accelerate relational data access

Cited by 9 publications

References 17 publications

Infrastruktur High-Available Learning Management System Universitas Menggunakan Least-Connected Load Balancer

Infrastruktur High-Available Learning Management System Universitas Menggunakan Least-Connected Load Balancer

Caching strategy for Web application – a systematic literature review

Improving Cached Data Offloading Optimization Based on Enhanced Hybrid Ant Colony Genetic Algorithm

Contact Info

Product

Resources

About