On the scale and performance of cooperative Web proxy caching

Wolman, Alec; Voelker, Geoffrey M.; Sharma, Neeraj; Cardwell, Neal; Karlin, Anna R.; Levy, Henry M.

doi:10.1145/346152.346166

Cited by 63 publications

(88 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, cache misses are always redirected to the nearest copy (either a CDN server or the primary site), i.e. we assume an ideal cooperative caching environment [34].…”

Section: Simulation Resultsmentioning

confidence: 99%

Combining replica placement and caching techniques in content distribution networks

Bakiras

Loukopoulos

2005

Computer Communications

View full text Add to dashboard Cite

“…Therefore, cache misses are always redirected to the nearest copy (either a CDN server or the primary site), i.e. we assume an ideal cooperative caching environment [34].…”

Section: Simulation Resultsmentioning

confidence: 99%

Combining replica placement and caching techniques in content distribution networks

Bakiras

Loukopoulos

2005

Computer Communications

View full text Add to dashboard Cite

“…Equally relevant to our research are experimental studies that seek to understand the effectiveness of DNS caching [6,8,16]. Several researchers lament the lack of data for longterm research and analysis in support of DNS performance, stability and security.…”

Section: Related Workmentioning

confidence: 99%

A global reference model of the domain name system

Jamakovic

Gijsen

2012

International Journal of Critical Infrastructure Protection

View full text Add to dashboard Cite

“…Krishnan et al [13] present empirical evaluation of cooperation for small population by concluding that cooperative caching can be useful. Wolman et al [26] quantify the potential benefits and drawbacks of inter-proxy cooperation for small and mediumsized organizations, and further examine cooperative caching performance in widearea setting using analytic modeling. Dykes et al [6] examine viability of cooperative proxy caching, and conclude that proxy cooperation offers at best a small speedup in average user response time.…”

Section: Related Workmentioning

confidence: 99%

Exploiting client caches to build large Web caches

Zhu

2007

J Supercomput

View full text Add to dashboard Cite

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.

show abstract

On the scale and performance of cooperative Web proxy caching

Abstract: Abstract

Cited by 63 publications

References 0 publications

Combining replica placement and caching techniques in content distribution networks

Combining replica placement and caching techniques in content distribution networks

A global reference model of the domain name system

Exploiting client caches to build large Web caches

Contact Info

Product

Resources

About