Replicated server placement with QoS constraints

Georgios Rodolakis*, Stavroula Siachalou, Leonidas Georgiadis

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

The problem of placing replicated servers with QoS constraints is considered. Each server site may consist of multiple server types with varying capacities and each site can be placed in any location among those belonging to a given set. Each client can de served by more than one locations as long as the request round-trip delay satisfies predetermined upper bounds. Our main focus is to minimize the cost of using the servers and utilizing the link bandwidth, while serving requests according to their delay constraint. This is an NP-hard problem. A pseudopolynomial and a polynomial algorithm that provide guaranteed approximation factors with respect to the optimal for the problem at hand are presented.

Original languageEnglish
Pages (from-to)207-220
Number of pages14
JournalLecture Notes in Computer Science
Volume3375
Publication statusPublished - 2005

Fingerprint

Dive into the research topics of 'Replicated server placement with QoS constraints'. Together they form a unique fingerprint.

Cite this