Replicated server placement with QoS constraints

Georgios Rodolakis; Stavroula Siachalou; Leonidas Georgiadis

doi:10.1109/TPDS.2006.145

Replicated server placement with QoS constraints

Georgios Rodolakis^*, Stavroula Siachalou, Leonidas Georgiadis

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

32 Citations (Scopus)

Abstract

The network planning 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 be served by more than one location as long as the round-trip delay of data requests 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 language	English
Pages (from-to)	1151-1162
Number of pages	12
Journal	IEEE Transactions on Parallel and Distributed Systems
Volume	17
Issue number	10
DOIs	https://doi.org/10.1109/TPDS.2006.145
Publication status	Published - Oct 2006

Keywords

Algorithm design and analysis
Applications
Client/server
Constrained optimization
Distributed file systems

Access to Document

10.1109/TPDS.2006.145

Cite this

@article{1b56fe14bb794360ba55af8e5d2e06dd,

title = "Replicated server placement with QoS constraints",

abstract = "The network planning 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 be served by more than one location as long as the round-trip delay of data requests 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.",

keywords = "Algorithm design and analysis, Applications, Client/server, Constrained optimization, Distributed file systems",

author = "Georgios Rodolakis and Stavroula Siachalou and Leonidas Georgiadis",

year = "2006",

month = oct,

doi = "10.1109/TPDS.2006.145",

language = "English",

volume = "17",

pages = "1151--1162",

journal = "IEEE Transactions on Parallel and Distributed Systems",

issn = "1045-9219",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

number = "10",

}

TY - JOUR

T1 - Replicated server placement with QoS constraints

AU - Rodolakis, Georgios

AU - Siachalou, Stavroula

AU - Georgiadis, Leonidas

PY - 2006/10

Y1 - 2006/10

N2 - The network planning 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 be served by more than one location as long as the round-trip delay of data requests 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.

AB - The network planning 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 be served by more than one location as long as the round-trip delay of data requests 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.

KW - Algorithm design and analysis

KW - Applications

KW - Client/server

KW - Constrained optimization

KW - Distributed file systems

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

U2 - 10.1109/TPDS.2006.145

DO - 10.1109/TPDS.2006.145

M3 - Article

AN - SCOPUS:33947413979

SN - 1045-9219

VL - 17

SP - 1151

EP - 1162

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

IS - 10

ER -

Replicated server placement with QoS constraints

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this