Show simple item record

dc.contributor.authorJin, Shudongen_US
dc.contributor.authorBestavros, Azeren_US
dc.date.accessioned2011-10-20T05:08:25Z
dc.date.available2011-10-20T05:08:25Z
dc.date.issued1999-08-21en_US
dc.identifier.citationJin, 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: http://hdl.handle.net/2144/1786]en_US
dc.identifier.urihttp://hdl.handle.net/2144/1786
dc.description.abstractWeb 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.sponsorshipNational Science Foundation (CCR-9706685)en_US
dc.language.isoen_USen_US
dc.publisherBoston University Computer Science Departmenten_US
dc.relation.ispartofseriesBUCS Technical Reports;BUCS-TR-1999-009en_US
dc.subjectWeb access characterizationen_US
dc.subjectWeb caching protocolsen_US
dc.subjectDistributed proxy cachingen_US
dc.subjectCache replacement algorithmsen_US
dc.subjectTrace-driven simulationsen_US
dc.titlePopularity-Aware GreedyDual-Size Web Proxy Caching Algorithmsen_US
dc.typeTechnical Reporten_US


Files in this item

This item appears in the following Collection(s)

Show simple item record