Evaluation of an Evolutionary Algorithm to Dynamically Alter Partition Sizes in Web Caching Systems
- 1 Department of Computer Science, Trent University, Peterborough, ON, Canada
- 2 Department of Computer Science, Trent University, Peterborough, ON, Canada
Abstract
There has been an explosion in the volume of data that is being accessed from the Internet. As a result, the risk of a Web server being inundated with requests is ever-present. One approach to reducing the performance degradation that potentially comes from Web server overloading is to employ Web caching where data content is replicated in multiple locations. In this paper, we investigate the use of evolutionary algorithms to dynamically alter partition size in Web caches. We use established modeling techniques to compare the performance of our evolutionary algorithm to that found in statically-partitioned systems. Our results indicate that utilizing an evolutionary algorithm to dynamically alter partition sizes can lead to performance improvements especially in environments where the relative size of large to small pages is high.
- Athena, V. (2002) Evolutionary Techniques for Web Caching. Distributed and Parallel Databases, 11, 93-116. https://doi.org/10.1023/A:1013385708178
- Calzarossa, M.C., Massari, L. and Tessera, D. (2016) Workload Characterization: A Survey Revisited. ACM Computing Survey, 48, Article No. 48. https://doi.org/10.1145/2856127
- Arlitt, M., Cherkasova, L., Dilley, J., Friedrich, R. and Jin, T. (1999) Evaluating Content Management Techniques for Web Proxy Caches. ACM SIGMETRICS Performance Evaluation Review, 27, 3-11. https://doi.org/10.1145/346000.346003
- Berger, D.S., Beckmann, N. and Harchol-Balter, M. (2018) Practical Bounds on Optimal Caching with Variable Object Sizes. ACM SIGMETRICS Performance Evaluation Review, 46, 24-26. https://doi.org/10.1145/3292040.3219627
- Veliskakis, M., et al. (2005) Domproxy: Enabling Dynamic-Content Front-End Web Caching. Proceedings of the 10th International Workshop on Web Content Caching and Distribution, Sophia Antipolis, 12-13 September 2005, 56-61.
- Kvaternik, K., Llorca, J., Kilper, D. and Pavel, L. (2016) A Methodology for the Design of Self-Optimizing, Decentralized Content-Caching Strategies. IEEE/ACM Transactions on Networking, 24, 2634-2647. https://doi.org/10.1109/TNET.2015.2478059
- Nguyen, H.V., Iacono, L.L. and Federrath, H. (2019) Mind the Cache: Large-Scale Explorative Study of Web Caching. Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, New York, NY, April 2019, 2497-2506. https://doi.org/10.1145/3297280.3297526
- Plumley, B. and Hurley, R.T. (2016) Effectiveness of Load Balancing in a Distributed Web Caching System. Proceedings of the 7th International Conference on Computer Modelling (ICCM2016), Berkeley, CA, 1-4 August 2016, 46-60.
- Hurley, R.T. and Li, B.Y. (2008) A Performance Investigation of Web Caching Architectures. Proceedings of the 2008 C3S2E Conference, 12-13 May 2008, 205-213. https://doi.org/10.1145/1370256.1370291
- Arlitt M., Friedrich, R. and Jin, T. (1999) Performance Evaluation of Web Proxy Cache Replacement Policies. Lecture Notes in Computer Science, 1469, 193-206. https://doi.org/10.1007/3-540-68061-6_16
- Hurley, R.T., Feng, W. and. Li, B.Y. (2003) Performance Benefits of Partitioning in a Web-Caching Environment. Proceedings of 16th International Conference on Computer Applications in Industry and Engineering, Las Vegas, Nevada, November 11-13, 2003, 64-69.