A Case for Dynamic Selection of Replication and Caching Strategies

Authors: Swaminathan Sivasubramanian, Guillaume Pierre and Maarten van Steen
Source: in Proceedings of the Eighth International Workshop on Web Content Caching and Distribution, September-October 2003.

Abstract

Replication and caching strategies are being used to reduce user perceived delay and wide area network traffic. Numerous such strategies have been proposed to manage replication while maintaining consistency among the replicas. In earlier research, we demonstrated that no single strategy can perform optimal for all documents, and proposed a system where strategies are selected on a per-document basis using trace-driven simulation techniques. In this paper, we demonstrate the need for continuous dynamic adaptation of strategies using experiments conducted on our department Web traces. We also propose two heuristics, Simple and Transition, to perform this dynamic adaptation with reduced simulation cost. In our experiments, we find that Transition heuristic reduces simulation cost by an order of magnitude while maintaining high accuracy in optimal strategy selection.

Download

	The paper, in gzipped Postscript (34,286 bytes).
	The paper, in PDF (60,984 bytes).

Bibtex Entry

@InProceedings{swami2003c,
  author = 	 {Swaminathan Sivasubramanian and Guillaume Pierre
                  and Maarten van Steen},
  title = 	 {A Case for Dynamic Selection of Replication and 
                  Caching Strategies},
  booktitle = 	 {Proceedings of the Eighth International Workshop on
                  Web Content Caching and Distribution (WCW'03)},
  year = 	 {2003},
  address = 	 {Hawthorne, NY, USA},
  month = 	 sep,
  note = 	 {\url{http://www.globule.org/publi/CDSRCS_wcw2003.html}}
}

gpierre@cs.vu.nl
Last modified: Thu Feb 12 15:40:30 2004