DOI: https://doi.org/10.14710/jtsiskom.8.1.2020.1-5

Algoritme penggantian cache proxy terdistribusi untuk meningkatkan kinerja server web

Distributed proxy cache replacement algorithm to improve web server performance

*Marvin Chandra Wijaya scopus  -  Department of Computer Engineering, Universitas Kristen Maranatha, Indonesia
Received: 18 Nov 2018; Revised: 26 Jul 2019; Accepted: 7 Aug 2019; Published: 31 Jan 2020; Available online: 5 Nov 2019.
Fulltext |
Open Access Copyright (c) 2020 Jurnal Teknologi dan Sistem Komputer
Creative Commons License This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Citation Format:
Abstract
The performance of web processing needs to increase to meet the growth of internet usage, one of which is by using cache on the web proxy server. This study examines the implementation of the proxy cache replacement algorithm to increase cache hits in the proxy server. The study was conducted by creating a clustered or distributed web server system using eight web server nodes. The system was able to provide increased latency by 90 % better and increased throughput of 5.33 times better.
Keywords: proxy server; distribute proxy cache; web QoS; cache replacement
Funding: Universitas Kristen Maranatha

Article Metrics:

Article Info
Section: Original Research Articles
Language : ID
Statistics: 880 318
Share:
Others articles
Desain dan Implementasi Standar Operasional Prosedur (SOP) Keamanan Sistem Informasi Fakultas Teknik Universitas Diponegoro Menggunakan Standar ISO 27001 Implementasi Sistem Informasi Geografis Daerah Pariwisata Kota Semarang Berbasis Android dengan Global Positioning System (GPS) K-means-SMOTE for handling class imbalance in the classification of diabetes with C4.5, SVM, and naive Bayes Teka-teki Unsur Kimia sebagai Media Pembelajaran Kimia Interaktif bagi siswa SMA Kelas X Berbasis Android Backward Chaining Analysis Model in Detecting Game Addiction Levels in Children More articles
Most cited articles
Perancangan Sistem Manajemen Restoran dengan Aplikasi Pemesanan Restoran Berbasis Mobile dalam Jaringan Lokal Parallel Spatial Pyramid Convolutional Neural Network for Kinship Verification from Face Images Parameter tuning in KNN for software defect prediction: an empirical analysis Application of Quality of Service on Internet Network using Hierarchical Token Bucket Method Perancangan Sistem Sensor Pemonitor Lingkungan Berbasis Jaringan Sensor Nirkabel More cited articles
  1. A. Loutonen and K. Altis, “World Wide Web proxies,” Computer Network and ISDN Systems, vol. 27, no. 2, pp. 147-154, 1994. doi: 10.1016/0169-7552(94)90128-7
  2. M. Abrams, C. R. Standridge, G. Abdulla, S. Williams, and E. A. Fox, “Caching proxies: Limitations and potentials,” in Fourth International World Wide Web Conference, Boston, USA, Dec. 1995, pp. 119 - 133
  3. J. Zhu, G. W. Yang, M. Hu, H-M. Shen, “A site-based proxy cache,” Journal of Computer Science and Technology, vol. 18, no. 2, pp. 258-263, 2003
  4. A. Vakali, “Proxy cache replacement algorithms: a history-based approach,” Journal World Wide Web, vol. 4, no. 4, pp. 277-297, 2001
  5. M-K. Liu, F-Y. Wang, and D. D. Zeng, “Web caching : a way to improve web QoS,” Journal Computer Science and Technology, vol. 19, no. 2, pp. 113 -127, 2004
  6. Y. Liu. Y. Wang, and H. Du, “Strong cache consistency on world wide web,” in 3rd International Conference on Advanced Computer Theory and Engineering, Chengdu, China, Aug. 2010, pp. 62-65. doi: 10.1109/ICACTE.2010.5579237
  7. J. Boyar, M. R. Ehmsen, J. S. Kohrt, and K. S. Larsen, “A theoretical comparison of LRU and LRU-K,” Acta Informatica, vol. 47, no. 7-8, 2010, pp. 359-374. doi: 10.1007/s00236-010-0123-6
  8. S. Roy, “H-NMRU: an efficient cache replacement policy with low area,” International Journal of Parallel Programming, vol. 48, no. 3-4, pp. 277-287, 2010. doi: 10.1007/s10766-010-0130-9
  9. A. Swami and K. B. Schiefer, “Estimating page fetches for index scans with finite LRU buffers,” The International Journal on Verly Large Data Bases, vol. 4, no. 4, pp. 675-701. 1995. doi: 10.1007/BF01354879
  10. K. Geetha and N. A. Gounden, “Dynamic semantic lfu policy with victim tracer (DSLV): a customizing technique for client cache,” Arabian Journal for Science and Engineering, vol. 42, no. 2, pp 725-737, 2017. doi: 10.1007/s13369-016-2287-z
  11. R. Rashkovits, “Preference-based content replacement using recency-latency tradeoff,” World Wide Web, vol. 19, no. 3, pp. 323-350, 2016. doi: 10.1007/s11280-014-0313-
  12. A. P. Negrao, C. Roque, P. Ferreira, and L. Veiga, “An adaptive semantics-aware replacement algorithm for web caching,” Journal of Internet Services and Application, vol. 6, no. 4, 2015. doi: 10.1186/s13174-015-0018-4
  13. A. M. K. Cheng and Z. Zhang, “Improving web server performance with adaptive proxy caching in soft real-time mobile applications,” The journal of VLSI Signal Processing Systems for Signal, Image and Video Technology, vol. 47, no. 2, pp. 103-115, 2007. doi: 10.1007/s11265-006-0021-x
  14. N. Xiao, Y-J. Zhao, F. Liu, Z-G. Chen, “Dual queues cache replacement algorithm based on sequentiality detection,” Science China Information Sciences, vol. 55, no. 1, pp. 191-199, 2012. doi: 10.1007/s11432-011-4213-z
  15. C. Li, P. Shilane, F. Douglis, and G. Wallace, “Pannier: a container-based flash cache for compound objects,” in 16th Annual Middleware Conference, Vancouver, Canada, Nov. 2015, pp. 50-62. doi: 10.1145/2814576.2814734
  16. K. C. Tsui, J. Liu, and M. J. Kaiser, “Self-organized load balancing in proxy servers: algorithms and performance,” Journal of Intelligent Information Systems, vol. 20, no. 1, pp. 31-50, 2003. doi: 10.1023/A:1020943021842
  17. I. Ivanisenko, “Methods and Algorithms of Load balancing,” International Journal Information Technologies & Knowledge, vol. 9, no. 4, pp. 340-375, 2015

Last update: 2021-03-07 16:45:03

No citation recorded.

Last update: 2021-03-07 16:45:03

No citation recorded.
Copyright (c) 2020 Jurnal Teknologi dan Sistem Komputer
Creative Commons License This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Starting in 2021, the author(s) whose article is published in the JTSiskom journal attain the copyright for their article. By submitting the manuscript to JTSiskom, the author(s) agree with this policy. No special document approval is required.

The author(s) guarantee that their article is original, written by the mentioned author(s), has never been published before, does not contain statements that violate the law, does not violate the rights of others, is subject to copyright that is held exclusively by the author(s), and is free from the rights of third parties, and that the necessary written permission to quote from other sources has been obtained by the author(s).

The author(s) retain all rights to the published work, such as (but not limited to) the following rights:

  • Copyright and other proprietary rights related to articles, such as patents,
  • The right to use the substance of the article in its own future works, including lectures and books,
  • The right to reproduce articles for its own purposes,
  • The right to archive articles yourself (please read our deposit policy), and
  • The right to enter into separate additional contractual arrangements for the non-exclusive distribution of published versions of articles (for example, posting them to institutional repositories or publishing them in a book), with acknowledgment of its initial publication in this journal (Journal of Technology and Computer Systems).

If the article was prepared jointly by more than one author, each author submitting the manuscript warrants that they have been given permission by all co-authors to agree to copyright and license notices (agreements) on their behalf, and agree to notify the co-authors of the terms of this policy. JTSiskom will not be held responsible for anything that may arise because of the writer's internal dispute. JTSiskom will only communicate with correspondence authors.

Authors should also understand that once published, their articles (and any additional files, including data sets, and analysis/computation data) will become publicly available. The license of published articles (and additional data) will be governed by the Creative Commons Attribution license as currently featured on the Creative Commons Attribution-ShareAlike 4.0 International License. JTSiskom allows users to copy, distribute, display and perform work under license. Users need to attribute the author(s) and JTSiskom to distribute works in journals and other publication media. Unless otherwise stated, the author(s) is a public entity as soon as the article is published.