Directly Selected and Limited Look up Cache Algorithm for Dynamic Web Contents

J. Lim and S. Rajasekaran (USA)

Keywords

web caching, web cache protocol, web server architecture

Abstract

This paper studies Direct Request Distribution and Load Balancing Cache protocol (DLC) and Directly Selected and Limited Look up (DSLL) cache algorithm based on Byte Access Frequency Factor (BAFF) for internet services with multimedia and dynamic web content. We present a new cache protocol and cache algorithm that achieves up to a 67% gain in performance for response time and 9.8 times more memory hits compared with conventional LRU and LFU algorithms. This algorithm uses a Byte Access Frequency Factor (BF) value for caching a document in the web servers’ memory. Our new cache protocol and algorithm have good performance gain both in current web client’s request pattern such as non-uniform request pattern and in ideal web client’s request pattern such as uniform request pattern. The DLC cache protocol updates cached static and dynamic contents completely and consistently in distributed cooperative web servers. Using this cache protocol and cache algorithm for web servers, we can build scalable web servers supporting very fast response times, high memory hit rate, and excellent load balancing of cooperative distributed web servers.

Important Links:



Go Back