QoS-aware replica placement for content distribution

Xueyan Tang*, Jianliang XU

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

114 Citations (Scopus)

Abstract

The rapid growth of new information services and business-oriented applications entails the consideration of quality of service (QoS) in content distribution. This paper investigates the QoS-aware replica placement problems for responsiveness QoS requirements. We consider two classes of service models: replica-aware services and replica-blind services. In replica-aware services, the servers are aware of the locations of replicas and can therefore optimize request routing to improve responsiveness. We show that the QoS-aware placement problem for replica-aware services is NP-complete. Several heuristic algorithms for fast computation of good solutions are proposed and experimentally evaluated. In replica-blind services, the servers are not aware of the locations of replicas or even their existence. As a result, each replica only serves the requests flowing through it under some given routing strategy. We show that there exist polynomial optimal solutions to the QoS-aware placement problem for replica-blind services. Efficient algorithms are proposed to compute the optimal locations of replicas under different cost models.

Original languageEnglish
Pages (from-to)921-932
Number of pages12
JournalIEEE Transactions on Parallel and Distributed Systems
Volume16
Issue number10
DOIs
Publication statusPublished - Oct 2005

Scopus Subject Areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

User-Defined Keywords

  • Content distribution
  • Dynamic programming
  • NP-complete
  • Placement
  • Quality of service
  • Replication

Fingerprint

Dive into the research topics of 'QoS-aware replica placement for content distribution'. Together they form a unique fingerprint.

Cite this