Replication algorithms for the World-Wide Web

Fathi Tenzakhti, Khaled Day, M. Ould-Khaoua

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

This paper addresses the two fundamental issues in replication, namely deciding on the number and placement of the replicas and the distribution of requests among replicas. We first introduce a centralized algorithm for replicating objects that can keep a balanced load on sites. In order to meet the requirement due to the dynamic nature of the Internet traffic and the rapid change in the access pattern of the World-Wide Web (Web), we also propose a distributed algorithm where each site relies on some collected information to decide on where to replicate and migrate objects to achieve good performance. The performance of the proposed algorithms is evaluated experimentally and a comparison of their measured performance is presented.

Original languageEnglish
Pages (from-to)591-605
Number of pages15
JournalJournal of Systems Architecture
Volume50
Issue number10
DOIs
Publication statusPublished - Oct 2004

Fingerprint

World Wide Web
Parallel algorithms
Internet

Keywords

  • Centralized/distributed replication
  • Load balancing
  • Performance analysis
  • Replication
  • Web

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this

Replication algorithms for the World-Wide Web. / Tenzakhti, Fathi; Day, Khaled; Ould-Khaoua, M.

In: Journal of Systems Architecture, Vol. 50, No. 10, 10.2004, p. 591-605.

Research output: Contribution to journalArticle

@article{ee5c9e91d6fb492386eae395ec29ff2c,
title = "Replication algorithms for the World-Wide Web",
abstract = "This paper addresses the two fundamental issues in replication, namely deciding on the number and placement of the replicas and the distribution of requests among replicas. We first introduce a centralized algorithm for replicating objects that can keep a balanced load on sites. In order to meet the requirement due to the dynamic nature of the Internet traffic and the rapid change in the access pattern of the World-Wide Web (Web), we also propose a distributed algorithm where each site relies on some collected information to decide on where to replicate and migrate objects to achieve good performance. The performance of the proposed algorithms is evaluated experimentally and a comparison of their measured performance is presented.",
keywords = "Centralized/distributed replication, Load balancing, Performance analysis, Replication, Web",
author = "Fathi Tenzakhti and Khaled Day and M. Ould-Khaoua",
year = "2004",
month = "10",
doi = "10.1016/j.sysarc.2003.12.003",
language = "English",
volume = "50",
pages = "591--605",
journal = "Journal of Systems Architecture",
issn = "1383-7621",
publisher = "Elsevier",
number = "10",

}

TY - JOUR

T1 - Replication algorithms for the World-Wide Web

AU - Tenzakhti, Fathi

AU - Day, Khaled

AU - Ould-Khaoua, M.

PY - 2004/10

Y1 - 2004/10

N2 - This paper addresses the two fundamental issues in replication, namely deciding on the number and placement of the replicas and the distribution of requests among replicas. We first introduce a centralized algorithm for replicating objects that can keep a balanced load on sites. In order to meet the requirement due to the dynamic nature of the Internet traffic and the rapid change in the access pattern of the World-Wide Web (Web), we also propose a distributed algorithm where each site relies on some collected information to decide on where to replicate and migrate objects to achieve good performance. The performance of the proposed algorithms is evaluated experimentally and a comparison of their measured performance is presented.

AB - This paper addresses the two fundamental issues in replication, namely deciding on the number and placement of the replicas and the distribution of requests among replicas. We first introduce a centralized algorithm for replicating objects that can keep a balanced load on sites. In order to meet the requirement due to the dynamic nature of the Internet traffic and the rapid change in the access pattern of the World-Wide Web (Web), we also propose a distributed algorithm where each site relies on some collected information to decide on where to replicate and migrate objects to achieve good performance. The performance of the proposed algorithms is evaluated experimentally and a comparison of their measured performance is presented.

KW - Centralized/distributed replication

KW - Load balancing

KW - Performance analysis

KW - Replication

KW - Web

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

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

U2 - 10.1016/j.sysarc.2003.12.003

DO - 10.1016/j.sysarc.2003.12.003

M3 - Article

VL - 50

SP - 591

EP - 605

JO - Journal of Systems Architecture

JF - Journal of Systems Architecture

SN - 1383-7621

IS - 10

ER -