Web Caching Strategy Optimization Based on Ant Colony Optimization and Genetic Algorithm

Web caching is a strategy that can be used to speed up website access on the client-side. This strategy is implemented by storing as many popular web objects as possible on the cache server. All web objects stored on a cache server are called cached data. Requests for cached web data on the cache server are much faster than requests directly to the origin server. Not all web objects can fit on the cache server due to their limited capacity. Therefore, optimizing cached data in a web caching strategy will determine which web objects can enter the cache server to have maximum profit. This paper simulates a web caching strategy optimization with a knapsack problem approach using the Ant Colony optimization (ACO), Genetic Algorithm (GA), and a combination of the two. Knapsack profit is seen from the number of web objects that can be entered into the cache server but with the minimum objective function value. The simulation results show that the combination of ACO and GA is faster to produce an optimal solution and is not easily trapped by the local optimum.