With the increasing popularity of the World Wide Web, the amount of Web traffic resulting from Web document requests is growing exponentially. In order to deduce the network loads and client latency, many solutions have been proposed. This thesis put special emphasis on cache technique, one of those solutions.In this paper we analyze the importance of different Web Proxy workload characteristics in making good cache replacement decisions and other aspects of proxy server.There are still many issues in cache design, which we give a brief discussion. This paper analyzes features of many existing caching strategies. Considering characteristics of different Web proxy workloads, this paper proposes a data-mining caching strategy called S3, which based on ORCL.This paper studies the relationship among the size, replacement algorithms and hit rate/weighted hit rate. The trace used in this simulation comes form Berkeley University. The simulation results show the S3 performs more excellent than ORCLin hit rate test.
|