Abstract
In this paper, we discuss and compare several policies to place replicas in tree networks subject to server capacity. The server capacities and client requests are known beforehand, while the number and location of the servers are to be determined. The standard approach in the literature is to enforce that all requests of a client be served by a single server in the tree (Single). One major contribution of this paper is to assess the impact of a new policy in which requests of a given client can be processed by multiple servers (Multiple), thus distributing the processing of requests over the platform. We characterize problem instances for which Multiple cannot be more than two times better than the optimal Single solution, if this latter exists. For such instances, we provide a procedure which builds a Single solution with a guarantee on its cost. This is a very interesting result for applications which do not accept multiple servers for a given client, since it might be more difficult to implement such a complex strategy.
Chapter PDF
Similar content being viewed by others
Keywords
References
Kalpakis, K., Dasgupta, K., Wolfson, O.: Optimal placement of replicas in trees with read, write, and storage costs. IEEE Trans. Parallel and Distributed Systems 12(6), 628–637 (1985)
Cidon, I., Kutten, S., Soffer, R.: Optimal allocation of electronic content. Computer Networks 40, 205–218 (2002)
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)
Wu, J.J., Lin, Y.F., Liu, P.: Optimal replica placement in hierarchical data grids with locality assurance. Journal of Parallel and Distributed Computing 68(12), 1517–1538 (2008)
Benoit, A., Rehn-Sonigo, V., Robert, Y.: Replica Placement and Access Policies in Tree Networks. IEEE Transactions on Parallel and Distributed Systems 19(12), 1614–1627 (2008)
Wolfson, O., Milo, A.: The multicast policy and its relationship to replicated data placement. ACM Trans. Database Syst. 16(1), 181–205 (1991)
Karlsson, M., Karamanolis, C., Mahalingam, M.: A framework for evaluating replica placement algorithms. Research Report HPL-2002-219, HP Laboratories, Palo Alto, CA (2002)
Karlsson, M., Karamanolis, C.: Choosing Replica Placement Heuristics for Wide-Area Systems. In: ICDCS 2004: Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), Washington, DC, USA, pp. 350–359. IEEE Computer Society, Los Alamitos (2004)
Rodolakis, G., Siachalou, S., Georgiadis, L.: Replicated server placement with QoS constraints. IEEE Trans. Par. Distr. Systems 17(10), 1151–1162 (2006)
Rehn-Sonigo, V.: Optimal Closest Policy with QoS and Bandwidth Constraints for Placing Replicas in Tree Networks. In: CoreGRID 2007, Core GRID Symposium 2007. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benoit, A. (2009). Comparison of Access Policies for Replica Placement in Tree Networks. In: Sips, H., Epema, D., Lin, HX. (eds) Euro-Par 2009 Parallel Processing. Euro-Par 2009. Lecture Notes in Computer Science, vol 5704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03869-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-03869-3_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03868-6
Online ISBN: 978-3-642-03869-3
eBook Packages: Computer ScienceComputer Science (R0)