Coordinated placement and replacement for grid-based hierarchical web caches

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Web caching has been well accepted as a viable method for saving network bandwidth and reducing user access latency. To provide cache sharing on a large scale, hierarchical web caching has been widely deployed to improve the scalability of content dissemination through the World Wide Web. In this paper, we present GHC, a grid-based hierarchical web caching architecture, for constructing efficient cache hierarchy in Grid environment. Basing on the GHC architecture, we also proposed HCPR algorithm, which is a novel coordinated placement and replacement algorithm for hierarchical web caching scheme. The principle of HCPR algorithm is to improve cache usage, to cache hot document close to clients so as to minimize the number of hops to locate and access Web documents. The simulation study shows that the HCPR algorithm has higher cache hit ratio and lower access latency compared with the traditional hierarchical caching algorithms. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Li, W., Wu, K., Ping, X., Tao, Y., Lu, S., & Chen, D. (2005). Coordinated placement and replacement for grid-based hierarchical web caches. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3795 LNCS, pp. 430–435). Springer Verlag. https://doi.org/10.1007/11590354_53

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free