Replication algorithms for the World-Wide Web

Fathi Tenzekhti, Khaled Day, Mohamed Ould-Khaoua

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 static centralized algorithm for replicating objects that can keep a balanced load on servers. To better meet the requirements of the dynamic nature of the Internet traffic and the rapid change in the access pattern of the WWW, we also propose a dynamic distributed algorithm where each server relies on some collected information to decide on where to replicate and migrate objects to achieve good performance and fault-tolerance levels.

Original languageEnglish
Title of host publicationProceedings - 16th Annual International Symposium on High Performance Computing Systems and Applications, HPCS 2002
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages84-89
Number of pages6
ISBN (Electronic)0769516262
DOIs
Publication statusPublished - 2002
Event16th Annual International Symposium on High Performance Computing Systems and Applications, HPCS 2002 - Moncton, Canada
Duration: Jun 16 2002Jun 19 2002

Publication series

NameProceedings - International Symposium on High Performance Computing Systems and Applications
Volume2002-January
ISSN (Print)1550-5243

Other

Other16th Annual International Symposium on High Performance Computing Systems and Applications, HPCS 2002
Country/TerritoryCanada
CityMoncton
Period6/16/026/19/02

Keywords

  • Internet
  • Load Balancing
  • Replication Protocols
  • Static/Dynamic Replication
  • World Wide Web

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Replication algorithms for the World-Wide Web'. Together they form a unique fingerprint.

Cite this