Semantic and cooperative document delivery over distributed systems
PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
Hi-index | 0.00 |
In this paper, we present a comprehebsive performance study of Least Recently Used and Least Frequently Used with Dynamic Aging as traditional replacement schemes as well as for the newly proposed schemes Greedy Dual Size and Greedy Dual *. The goal of our study constitutes the understanding how these replacement schemes deal with different web document types. Using trace-driven simulation, we present curves plotting the hit rate and byte hit rate broken down for image, HTML, multi media, and application documents. The presented results show for the first workload that under the packet cost model Greedy Dual * outperforms the other schemes both in terms of hit rate and byte hit rate for image, HTML, and multi media documents. However, the advantages of Greedy Dual * diminish when the workload contains more distinct multi media documents and a larger number of requests to multi media documents.