Storage allocation in web prefetching techniques

Daniel D. Zeng, Fei Yue Wang, Sudha Ram

Research output: Contribution to conferencePaper

2 Scopus citations

Abstract

The importance of effective storage allocation in prefetching is advocated. Focus is on three contributions. First, new formulations of the storage allocation problem in the prefetching context are provided. Second, computationall efficient allocation policies are examined based on the observation that all the storage allocation formulations can be solved as the KNAPSACK PROBLEM. Third, storage allocation models are shown to lead to a more precise understanding of the widely-used Top-n policy and its applicability and effectiveness.

Original languageEnglish (US)
Pages264-265
Number of pages2
StatePublished - Nov 19 2003
EventProceedings of the 4th ACM Conference on Electronic Commerce - San Diego, CA, United States
Duration: Jun 9 2003Jun 12 2003

Other

OtherProceedings of the 4th ACM Conference on Electronic Commerce
CountryUnited States
CitySan Diego, CA
Period6/9/036/12/03

Keywords

  • Prefetching
  • Storage allocation
  • Web caching

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Zeng, D. D., Wang, F. Y., & Ram, S. (2003). Storage allocation in web prefetching techniques. 264-265. Paper presented at Proceedings of the 4th ACM Conference on Electronic Commerce, San Diego, CA, United States.