Adaptive schemes for distributed web caching

Spiridon Bakiras, Thanasis Loukopoulos, Dimitris Papadias, Ishfaq Ahmad

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In distributed web caching architectures, institutional proxies take advantage of their neighbors' contents in order to reduce the number of requests forwarded to the server. Intuitively, the maximum benefit from this cooperation is expected when the proxies that exhibit similar requests are grouped together. The current practice is to follow a static and manual configuration of neighbors. Such an approach has a number of drawbacks: (i) static allocation may not determine the best neighbors, especially if global knowledge of the participating proxies is not available, (ii) a manual allocation places significant administrative burden, (iii) static schemes are insensitive to changes in access patterns, and (iv) they cannot deal with the introduction of new, potentially useful, proxies. In this paper, we propose a set of algorithms that allow proxies to independently explore the network for better neighbors and continuously update their configuration in an adaptive fashion. The simulation experiments illustrate that dynamic neighbor reconfiguration leads to significantly higher hit ratios compared to the static approach. Although some researchers in the past have recognized the need for adaptive caching, to the best of our knowledge this is the first study to propose concrete algorithms and evaluate their efficacy.

Original languageEnglish
Pages (from-to)1483-1496
Number of pages14
JournalJournal of Parallel and Distributed Computing
Volume65
Issue number12
DOIs
Publication statusPublished - Dec 2005
Externally publishedYes

Fingerprint

Web Caching
Servers
Concretes
Configuration
Caching
Reconfiguration
Hits
Simulation Experiment
Efficacy
Server
Update
Experiments
Evaluate

Keywords

  • Cache digests
  • Distributed caching
  • Squid
  • Web proxies

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

Adaptive schemes for distributed web caching. / Bakiras, Spiridon; Loukopoulos, Thanasis; Papadias, Dimitris; Ahmad, Ishfaq.

In: Journal of Parallel and Distributed Computing, Vol. 65, No. 12, 12.2005, p. 1483-1496.

Research output: Contribution to journalArticle

Bakiras, Spiridon ; Loukopoulos, Thanasis ; Papadias, Dimitris ; Ahmad, Ishfaq. / Adaptive schemes for distributed web caching. In: Journal of Parallel and Distributed Computing. 2005 ; Vol. 65, No. 12. pp. 1483-1496.
@article{3e2c8b0dfeef402db584cc7a94289054,
title = "Adaptive schemes for distributed web caching",
abstract = "In distributed web caching architectures, institutional proxies take advantage of their neighbors' contents in order to reduce the number of requests forwarded to the server. Intuitively, the maximum benefit from this cooperation is expected when the proxies that exhibit similar requests are grouped together. The current practice is to follow a static and manual configuration of neighbors. Such an approach has a number of drawbacks: (i) static allocation may not determine the best neighbors, especially if global knowledge of the participating proxies is not available, (ii) a manual allocation places significant administrative burden, (iii) static schemes are insensitive to changes in access patterns, and (iv) they cannot deal with the introduction of new, potentially useful, proxies. In this paper, we propose a set of algorithms that allow proxies to independently explore the network for better neighbors and continuously update their configuration in an adaptive fashion. The simulation experiments illustrate that dynamic neighbor reconfiguration leads to significantly higher hit ratios compared to the static approach. Although some researchers in the past have recognized the need for adaptive caching, to the best of our knowledge this is the first study to propose concrete algorithms and evaluate their efficacy.",
keywords = "Cache digests, Distributed caching, Squid, Web proxies",
author = "Spiridon Bakiras and Thanasis Loukopoulos and Dimitris Papadias and Ishfaq Ahmad",
year = "2005",
month = "12",
doi = "10.1016/j.jpdc.2005.05.020",
language = "English",
volume = "65",
pages = "1483--1496",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "12",

}

TY - JOUR

T1 - Adaptive schemes for distributed web caching

AU - Bakiras, Spiridon

AU - Loukopoulos, Thanasis

AU - Papadias, Dimitris

AU - Ahmad, Ishfaq

PY - 2005/12

Y1 - 2005/12

N2 - In distributed web caching architectures, institutional proxies take advantage of their neighbors' contents in order to reduce the number of requests forwarded to the server. Intuitively, the maximum benefit from this cooperation is expected when the proxies that exhibit similar requests are grouped together. The current practice is to follow a static and manual configuration of neighbors. Such an approach has a number of drawbacks: (i) static allocation may not determine the best neighbors, especially if global knowledge of the participating proxies is not available, (ii) a manual allocation places significant administrative burden, (iii) static schemes are insensitive to changes in access patterns, and (iv) they cannot deal with the introduction of new, potentially useful, proxies. In this paper, we propose a set of algorithms that allow proxies to independently explore the network for better neighbors and continuously update their configuration in an adaptive fashion. The simulation experiments illustrate that dynamic neighbor reconfiguration leads to significantly higher hit ratios compared to the static approach. Although some researchers in the past have recognized the need for adaptive caching, to the best of our knowledge this is the first study to propose concrete algorithms and evaluate their efficacy.

AB - In distributed web caching architectures, institutional proxies take advantage of their neighbors' contents in order to reduce the number of requests forwarded to the server. Intuitively, the maximum benefit from this cooperation is expected when the proxies that exhibit similar requests are grouped together. The current practice is to follow a static and manual configuration of neighbors. Such an approach has a number of drawbacks: (i) static allocation may not determine the best neighbors, especially if global knowledge of the participating proxies is not available, (ii) a manual allocation places significant administrative burden, (iii) static schemes are insensitive to changes in access patterns, and (iv) they cannot deal with the introduction of new, potentially useful, proxies. In this paper, we propose a set of algorithms that allow proxies to independently explore the network for better neighbors and continuously update their configuration in an adaptive fashion. The simulation experiments illustrate that dynamic neighbor reconfiguration leads to significantly higher hit ratios compared to the static approach. Although some researchers in the past have recognized the need for adaptive caching, to the best of our knowledge this is the first study to propose concrete algorithms and evaluate their efficacy.

KW - Cache digests

KW - Distributed caching

KW - Squid

KW - Web proxies

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

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

U2 - 10.1016/j.jpdc.2005.05.020

DO - 10.1016/j.jpdc.2005.05.020

M3 - Article

VL - 65

SP - 1483

EP - 1496

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 12

ER -