A novel cache replacement policy for Web content delivery

The Web content delivery and the cache replacement policy greatly affecting the performance of Web server were studied. Considering that the current cache replacement schemes mainly use the frequency and locality as the basis of replacement and it is found the access interval change rate is more valuable in predicting the new objects arrival through analyzing the real network logs, a novel cache replacement policy based on the access density and the object size was proposed. When using this novel method, the cache can achieve a higher byte hit ratio. The experimental results shows that the method improves 3%~5% of the hit rate than the LRU (least recently used) and LFU (least frequently used), and 5%~8% of the byte hit rate than the GDSF (greedy dual size and frequency).