Abstract
This paper discusses and compares several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, while the number and location of the servers are to be determined. We study three strategies. The first two strategies assign each client to a unique server while the third allows requests of a client to be processed by multiple servers. The main contribution of this paper is to assess the impact of QoS constraints on the total replication cost. In this paper, we establish the NP-completeness of the problem on homogeneous networks when the requests of a given client can be processed by multiple servers. We provide several efficient polynomial heuristic algorithms for NP-complete instances of the problem.
Chapter PDF
Similar content being viewed by others
Keywords
References
Benoit, A., Rehn, V., Robert, Y.: Impact of QoS on Replica Placement in Tree Networks. Research Report 2006-48, LIP, ENS Lyon, France (2006), available at http://graal.ens-lyon.fr/~yrobert/
Benoit, A., Rehn, V., Robert, Y.: Strategies for Replica Placement in Tree Networks. Research Report 2006-30, LIP, ENS Lyon, France (2006), available at http://graal.ens-lyon.fr/~yrobert/
Chen, Y., Katz, R.H., Kubiatowicz, J.D.: Dynamic Replica Placement for Scalable Content Delivery. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 306–318. Springer, Heidelberg (2002)
Cidon, I., Kutten, S., Soffer, R.: Optimal allocation of electronic content. Computer Networks 40, 205–218 (2002)
Garey, M.R., Johnson, D.S.: Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
GLPK: GNU Linear Programming Kit, http://www.gnu.org/software/glpk/
Liu, P., Lin, Y.F., Wu, J.J.: Optimal placement of replicas in data grid environments with locality assurance. In: International Conference on Parallel and Distributed Systems (ICPADS), IEEE Computer Society Press, Los Alamitos (2006)
Source Code for the Heuristics, http://graal.ens-lyon.fr/~vrehn/code/replicaQoS/
Tang, X., Xu, J.: QoS-Aware Replica Placement for Content Distribution. IEEE Trans. Parallel Distributed Systems 16(10), 921–932 (2005)
Wang, H., Liu, P., Wu, J.J.: A QoS-aware Heuristic Algorithm for Replica Placement. In: Proceedings of the 7th International Conference on Grid Computing, GRID2006, pp. 96–103. IEEE Computer Society Press, Los Alamitos (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Benoit, A., Rehn, V., Robert, Y. (2007). Impact of QoS on Replica Placement in Tree Networks. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds) Computational Science – ICCS 2007. ICCS 2007. Lecture Notes in Computer Science, vol 4487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72584-8_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-72584-8_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72583-1
Online ISBN: 978-3-540-72584-8
eBook Packages: Computer ScienceComputer Science (R0)