Storage allocation in web prefetching techniques

Dajun Zeng, Fei Yue Wang, Sudha Ram

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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)
Title of host publicationProceedings of the ACM Conference on Electronic Commerce
Pages264-265
Number of pages2
StatePublished - 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

Fingerprint

World Wide Web
Efficient allocation
Allocation problem

Keywords

  • Prefetching
  • Storage allocation
  • Web caching

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Business, Management and Accounting (miscellaneous)

Cite this

Zeng, D., Wang, F. Y., & Ram, S. (2003). Storage allocation in web prefetching techniques. In Proceedings of the ACM Conference on Electronic Commerce (pp. 264-265)

Storage allocation in web prefetching techniques. / Zeng, Dajun; Wang, Fei Yue; Ram, Sudha.

Proceedings of the ACM Conference on Electronic Commerce. 2003. p. 264-265.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zeng, D, Wang, FY & Ram, S 2003, Storage allocation in web prefetching techniques. in Proceedings of the ACM Conference on Electronic Commerce. pp. 264-265, Proceedings of the 4th ACM Conference on Electronic Commerce, San Diego, CA, United States, 6/9/03.
Zeng D, Wang FY, Ram S. Storage allocation in web prefetching techniques. In Proceedings of the ACM Conference on Electronic Commerce. 2003. p. 264-265
Zeng, Dajun ; Wang, Fei Yue ; Ram, Sudha. / Storage allocation in web prefetching techniques. Proceedings of the ACM Conference on Electronic Commerce. 2003. pp. 264-265
@inproceedings{53decb2c50b74eb69a0f9bc90dddfd9b,
title = "Storage allocation in web prefetching techniques",
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.",
keywords = "Prefetching, Storage allocation, Web caching",
author = "Dajun Zeng and Wang, {Fei Yue} and Sudha Ram",
year = "2003",
language = "English (US)",
pages = "264--265",
booktitle = "Proceedings of the ACM Conference on Electronic Commerce",

}

TY - GEN

T1 - Storage allocation in web prefetching techniques

AU - Zeng, Dajun

AU - Wang, Fei Yue

AU - Ram, Sudha

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - Prefetching

KW - Storage allocation

KW - Web caching

UR - http://www.scopus.com/inward/record.url?scp=0242624644&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0242624644&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0242624644

SP - 264

EP - 265

BT - Proceedings of the ACM Conference on Electronic Commerce

ER -