Name
Abstract | ||
|---|---|---|
New demands brought by the continuing growth of the Internet will be met in part by more effective and comprehensive use of caching. This paper proposes to exploit client browser caches in the context of cooperative proxy caching by constructing the client caches within each organization (e.g., corporate networks) as a peer-to-peer (P2P) client cache. Via trace-driven simulations we evaluate the potential performance benefit of cooperative proxy caching with/without exploiting client caches. We show that exploiting client caches in cooperative proxy caching can significantly improve performance, particularly when the size of individual proxy caches is limited compared to the universe of Web objects. We further devise a cooperative hierarchical greedy-dual replacement algorithm (Hier-GD), which not only provides some cache coordination but also utilizes client caches. Through Hier-GD, we explore the design issues of how to exploit client caches in cooperative proxy caching to build large Web caches. We show that Hier-GD is technically practical and can potentially improve the performance of cooperative proxy caching by utilizing client caches. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s11227-007-0108-6 | The Journal of Supercomputing |
Keywords | Field | DocType |
Peer-to-peer,Hier-GD,Client cache,Proxy cache,Latency gain,Infinite cache size,Cooperative proxy caching | Peer-to-peer,Supercomputer,Computer science,Cache,CPU cache,Parallel computing,Server,Computer network,Exploit,False sharing,The Internet,Distributed computing | Journal |
Volume | Issue | ISSN |
39 | 2 | 0920-8542 |
Citations | PageRank | References |
5 | 0.49 | 21 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yingwu Zhu | 1 | 362 | 23.69 |
| Yiming Hu | 2 | 639 | 44.91 |