Popularity-Aware GreedyDual-Size Web Proxy Caching Algorithms


Show simple item record Jin, Shudong en_US Bestavros, Azer en_US 2011-10-20T05:08:25Z 2011-10-20T05:08:25Z 1999-08-21 en_US
dc.identifier.citation Jin, Shudong; Bestavros, Azer. "Popularity-Aware GreedyDual-Size Web Proxy Caching Algorithms", Technical Report BUCS-1999-009, Computer Science Department, Boston University, August 21, 1999. [Available from:] en_US
dc.description.abstract Web caching aims to reduce network traffic, server load, and user-perceived retrieval delays by replicating "popular" content on proxy caches that are strategically placed within the network. While key to effective cache utilization, popularity information (e.g. relative access frequencies of objects requested through a proxy) is seldom incorporated directly in cache replacement algorithms. Rather, other properties of the request stream (e.g. temporal locality and content size), which are easier to capture in an on-line fashion, are used to indirectly infer popularity information, and hence drive cache replacement policies. Recent studies suggest that the correlation between these secondary properties and popularity is weakening due in part to the prevalence of efficient client and proxy caches (which tend to mask these correlations). This trend points to the need for proxy cache replacement algorithms that directly capture and use popularity information. In this paper, we (1) present an on-line algorithm that effectively captures and maintains an accurate popularity profile of Web objects requested through a caching proxy, (2) propose a novel cache replacement policy that uses such information to generalize the well-known GreedyDual-Size algorithm, and (3) show the superiority of our proposed algorithm by comparing it to a host of recently-proposed and widely-used algorithms using extensive trace-driven simulations and a variety of performance metrics. en_US
dc.description.sponsorship National Science Foundation (CCR-9706685) en_US
dc.language.iso en_US en_US
dc.publisher Boston University Computer Science Department en_US
dc.relation.ispartofseries BUCS Technical Reports;BUCS-TR-1999-009 en_US
dc.subject Web access characterization en_US
dc.subject Web caching protocols en_US
dc.subject Distributed proxy caching en_US
dc.subject Cache replacement algorithms en_US
dc.subject Trace-driven simulations en_US
dc.title Popularity-Aware GreedyDual-Size Web Proxy Caching Algorithms en_US
dc.type Technical Report en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search OpenBU


Deposit Materials