Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Performance comparison of cache replacement algorithms onvarious internet traffic

JURNAL INFOTEL · Vol. 15 No. 1 (2023) · hlm. 1–7

DOI
10.20895/infotel.v15i1.872
ISSN
2085-3688, 2460-0997
Terbit
2023-02-01
Penerbit
LPPM Institut Teknologi Telkom Purwokerto
Bahasa
en
Lisensi
creativecommons.org/licenses/by-sa/4.0/

Abstrak

Internet users tend to skip and look for alternative websites if they have slow response times. For cloud network managers, implementing a caching strategy on the edge network can help lighten the workload of databases and application servers. The caching strategy is carried out by storing frequently accessed data objects in cache memory. Through this strategy, the speed of access to the same data becomes faster. Cache replacement is the main mechanism of the caching strategy. There are seven cache replacement algorithms with good performance that can be used, namely LRU, LFU, LFUDA, GDS, GDSF, SIZE, and FIFO. The algorithm is developed uniquely according to the internet traffic patterns encountered. Therefore, a particular cache replacement algorithm cannot be superior to other algorithms. This paper presents a performance comparison simulation of the seven cache replacement algorithms on various internet traffic extracted from the public IRcache dataset. The results of this study indicate that the hit ratio performance is strongly influenced by cache size, cacheable and unique requests. The smaller the unique request that occurs, the greater the hit ratio performance obtained. The LRU algorithm shows an excellent hit ratio performance to perform cache replacement work under normal internet conditions. However, when the access impulse phenomenon occurs, the GDSF algorithm is superior in obtaining hit ratios with limited cache memory capacity. The simulation results show that GDSF reaches a 50.75% hit ratio while LRU is only 49.17% when access anomalies occur.

Kata kunci

Jaringan kolaborasi para penulis

23 penulis · 46 tautan kepenulisan bersama · 12 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Universitas Gadjah Mada
  • Jenderal Soedirman University
  • King Abdulaziz University
  • Universitas Teknologi Yogyakarta
  • Institut Teknologi Telkom Purwokerto
  • Institut Teknologi Sepuluh Nopember
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Anang Anggono LutfiUniversitas Gadjah Mada2
Silmi FauziatiUniversitas Gadjah Mada2
Andreas Sahir AryantoJenderal Soedirman University2
Yogi RamadhaniJenderal Soedirman University2
Eko MurdiyantoroJenderal Soedirman University2
Muhammad Syaiful AliimJenderal Soedirman University2
Acep TaryanaInstitut Teknologi Sepuluh Nopember2
Azis Wisnu Widhi NugrahaJenderal Soedirman University2
Nur Annisa TresnasariUniversitas Gadjah Mada1
Teguh Bharata AdjiUniversitas Gadjah Mada1
Saucha DiwandariUniversitas Teknologi Yogyakarta1
Indriana HidayahUniversitas Gadjah Mada1
Pulung Hendro PrastyoUniversitas Gadjah Mada1
Amin Siddiq SumiUniversitas Gadjah Mada1
Ade Widyatama DianUniversitas Gadjah Mada1
Norma AmaliaInstitut Teknologi Telkom Purwokerto1
Daffa Afif NasrudinAfiliasi tidak diketahui1
Wicaksono WidiatmokoAfiliasi tidak diketahui1
Arief Wisnu WardhanaJenderal Soedirman University1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S4210188896, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title xml:lang="en">Performance comparison of cache replacement algorithms onvarious internet traffic</dc:title><dc:creator>Mulki Indana Zulfa</dc:creator><dc:creator>Ari Fadli</dc:creator><dc:creator>Adhistya Erna Permanasari</dc:creator><dc:creator>Waleed Ali</dc:creator><dc:subject>cache replacement policy</dc:subject><dc:subject>edge caching</dc:subject><dc:subject>hit rate</dc:subject><dc:subject>LRU</dc:subject><dc:subject>LFU</dc:subject><dc:subject>GDS</dc:subject><dc:subject>FIFO</dc:subject><dc:subject>cache size</dc:subject><dc:description xml:lang="en">Internet users tend to skip and look for alternative websites if they have slow response times. For cloud network managers, implementing a caching strategy on the edge network can help lighten the workload of databases and application servers. The caching strategy is carried out by storing frequently accessed data objects in cache memory. Through this strategy, the speed of access to the same data becomes faster. Cache replacement is the main mechanism of the caching strategy. There are seven cache replacement algorithms with good performance that can be used, namely LRU, LFU, LFUDA, GDS, GDSF, SIZE, and FIFO. The algorithm is developed uniquely according to the internet traffic patterns encountered. Therefore, a particular cache replacement algorithm cannot be superior to other algorithms. This paper presents a performance comparison simulation of the seven cache replacement algorithms on various internet traffic extracted from the public IRcache dataset. The results of this study indicate that the hit ratio performance is strongly influenced by cache size, cacheable and unique requests. The smaller the unique request that occurs, the greater the hit ratio performance obtained. The LRU algorithm shows an excellent hit ratio performance to perform cache replacement work under normal internet conditions. However, when the access impulse phenomenon occurs, the GDSF algorithm is superior in obtaining hit ratios with limited cache memory capacity. The simulation results show that GDSF reaches a 50.75% hit ratio while LRU is only 49.17% when access anomalies occur.</dc:description><dc:publisher>LPPM Institut Teknologi Telkom Purwokerto</dc:publisher><dc:date>2023-02-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.20895/infotel.v15i1.872</dc:identifier><dc:identifier>10.20895/infotel.v15i1.872</dc:identifier><dc:source>JURNAL INFOTEL; Vol 15 No 1 (2023); 1-7</dc:source><dc:source>2085-3688</dc:source><dc:source>2460-0997</dc:source><dc:language>en</dc:language><dc:relation>https://ejournal.st3telkom.ac.id/index.php/infotel/article/download/872/414</dc:relation><dc:rights>https://creativecommons.org/licenses/by-sa/4.0/</dc:rights></oai_dc:dc>