## Replicated Server Placement with QoS constraints (2006)

### Cached

### Download Links

- [genesis.ee.auth.gr]
- [genesis.ee.auth.gr]
- DBLP

### Other Repositories/Bibliography

Venue: | PUBLICATIONS IN CONFERENCES AND WORKSHOPS |

Citations: | 8 - 0 self |

### BibTeX

@INPROCEEDINGS{Rodolakis06replicatedserver,

author = {Georgios Rodolakis and Stavroula Siachalou and Leonidas Georgiadis},

title = {Replicated Server Placement with QoS constraints},

booktitle = { PUBLICATIONS IN CONFERENCES AND WORKSHOPS},

year = {2006},

pages = {2006},

publisher = {}

}

### OpenURL

### 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 locationsaslongastherequestround-tripdelaysatisfies 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.