Abstract
The main issues in computer network is to maximize usages of bandwidth and the client waiting time. This is all causes by a poor management of requested popular object in World Wide Web. Web proxy cache can potentially improve network performance from three aspects: the number of requests that reaches the server, the volume of data transferred through the network and the latency that an
end-user experiences in retrieving a document. Many research efforts have been done to compare the performance of different caching algorithms in terms of the first two measures. In this paper, trace-driven has been used to compare performance of cache replacement algorithms which are Least Recently Used (LRU), Least Frequently Used (LFU) and Greedy Dual Size (GD-Size).
Keywords: Web proxy, Trace Driven Simulation, caching algorithms.
Website : http://ir.fsksm.utm.my/1322/
No comments:
Post a Comment