An optimal method for coordinated en-route web object caching

Keqiu Li, Hong Shen

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

4 Citations (Scopus)

Abstract

Web caching is an important technology for saving network bandwidth, alleviating server load, and reducing the response time experienced by users. In this paper, we consider the object caching problem of determining the optimal number of copies of an object to be placed among en-route caches on the access path from the user to the content server and their locations such that the overall net cost saving is maximized. We propose an object caching model for the case that the network topology is a tree. The existing method can be viewed as a special case of ours since it considers only linear topology. We formulate our problem as an optimization problem and the optimal placement is obtained by applying our dynamic programming-based algorithm. We also present some analysis of our algorithm, which shows that our solution is globally optimal. Finally, we describe some numerical experiments to show how optimal placement can be determined by our algorithm.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsAlex Veidenbaum, Kazuki Joe, Hideharu Amano, Hideo Aiso
PublisherSpringer Verlag
Pages368-375
Number of pages8
ISBN (Print)3540203591, 9783540397076
DOIs
Publication statusPublished - 2003
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2858
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Algorithm
  • Dynamic programming
  • Optimization problem
  • Web caching

Fingerprint

Dive into the research topics of 'An optimal method for coordinated en-route web object caching'. Together they form a unique fingerprint.

Cite this