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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Krishnan, R., Raz, D., Shavitt, Y.: The cache location problem. IEEE/ACM Transactions on Networking 8, 568–582 (2000)
Li, B., Golin, M., Italiano, G., Deng, X.: On the optimal placement of web proxies in the internet. In: IEEE INFOCOM (1999)
Jia, X., Li, D., Hu, X., Du, D.: Optimal placement of web proxies for replicated web servers in the internet. The Computer Journal 44, 329–339 (2001)
Qiu, L., Padmanabhan, V., Voelker, G.: On the placement of web server replicas. In: IEEE INFOCOM, pp. 1587–1596 (2001)
Chen, Y., Katz, R., Kubiatowicz, J.: Dynamic replica placement for scalable content delivery. In: First International Workshop on Peer-to-Peer Systems, pp. 306–318 (2002)
Jamin, S., Jiu, C., Kurc, A., Raz, D., Shavitt, Y.: Constrained mirror palcement on the internet. In: IEEE INFOCOM, pp. 31–40 (2001)
Sayal, M., Breitbart, Y., Scheuermann, P., Vingralek, R.: Selection algorithms for replicated web servers. In: Workshop on Internet Server Performance, Madison, Wisconsin (1998)
Tang, X., Xu, J.: On replica placement for QoS-aware content distribution. In: IEEE INFOCOM (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory on NP-Completeness. W. H. Freeman and Company, New York (1979)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)
Mahdian, M., Markakis, E., Saberi, A., Varizani, V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM 50, 795–824 (2003)
Hajiaghavi, M.T., Mahdian, M., Mirrokni, V.S.: The facility location problem with general cost functions. Networks 42, 42–47 (2003)
Siachalou, S., Georgiadis, L.: Efficient QoS routing. Computer Networks 43, 351–367 (2003)
Mieghem, P.V., de Neve, H., Kuipers, F.: Hop-by-hop quality of service routing. Computer Networks 37, 407–423 (2001)
Andonov, R., Rajopadhye, S.: A sparse knapsack algo-tech-cuit and its synthesis. In: International Conference on Application Specific Array Processors ASPA 1994, IEEE, Los Alamitos (1994)
Lorenz, D.H., Raz, D.: A simple and efficient approximation scheme for the restricted shortest path problem. Operations Research Letters 28, 213–221 (2001)
de Berg, M., Schwarzkoph, O., Kreveld, M.V., Overmars, M.: Computional Geometry: Algorithms and Applications. Springer, Heidelberg (2000)
Mehlhorn, K., Naher, S.: Leda: A platform for combinatorial and geometric computing. Cambridge University Press, Cambridge (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rodolakis, G., Siachalou, S., Georgiadis, L. (2005). Replicated Server Placement with QoS Constraints. In: Ajmone Marsan, M., Bianchi, G., Listanti, M., Meo, M. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2004. Lecture Notes in Computer Science, vol 3375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30573-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-30573-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24557-5
Online ISBN: 978-3-540-30573-6
eBook Packages: Computer ScienceComputer Science (R0)