Replicated server placement with qos constraints

Authors:
Georgios Rodolakis;Stavroula Siachalou;Leonidas Georgiadis
Affiliations:
Hipercon Project, INRIA Rocquencourt, Le Chesnay Cedex, France;Faculty of Engineering, School of Electrical and Computer Engineering, Telecommunications Dept, Aristotle Univ. of Thessaloniki, Thessaloniki, Greece;Faculty of Engineering, School of Electrical and Computer Engineering, Telecommunications Dept, Aristotle Univ. of Thessaloniki, Thessaloniki, Greece
Venue:
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Year:
2005

Citing 11
Cited 2

Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Selection algorithms for replicated Web servers

ACM SIGMETRICS Performance Evaluation Review
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
The cache location problem

IEEE/ACM Transactions on Networking (TON)
Hop-by-hop quality of service routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Dynamic Replica Placement for Scalable Content Delivery

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology

HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

Journal of the ACM (JACM)
Efficient QoS routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
A simple efficient approximation scheme for the restricted shortest path problem

Operations Research Letters

Networks Consolidation through Soft Computing

ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Managing traffic demand uncertainty in replica server placement with robust optimization

NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems

Quantified Score

Hi-index	0.00

Visualization

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.