Optimal methods for object placement in en-route web caching for tree networks and autonomous systems

Keqiu Li, Hong Shen

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

2 Citations (Scopus)

Abstract

This paper addresses the problem of computing the locations of copies of an object to be placed among the en-route caches such that the overall cost gain is maximized for tree networks. This problem is formulated as an optimization problem and both unconstrained and constrained cases are considered. The constrained case includes constraints on the cost gain per node and on the number of copies to be placed. Low-cost dynamic programming-based algorithms that provide optimal solutions for these cases are derived. Furthermore, based on our mathematical model, a solution to coordinated en-route web caching (CERWC) for autonomous systems (ASes) is also presented. The implementation results show that our methods outperform existing algorithms for both CERWC for linear topology and object placement at individual nodes.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsMinglu Li, Qianni Deng, Xian-He Sun, Jun Ni
PublisherSpringer Verlag
Pages263-270
Number of pages8
ISBN (Print)3540219935, 9783540219934
DOIs
Publication statusPublished - 2004
Externally publishedYes

Publication series

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

Keywords

  • Autonomous system
  • Dynamic programming
  • Object placement
  • Tree network
  • Web caching

Fingerprint

Dive into the research topics of 'Optimal methods for object placement in en-route web caching for tree networks and autonomous systems'. Together they form a unique fingerprint.

Cite this