Abstract
One of the challenges in data replication is to select the candidate sites to place replicas. We use the p-median and p-center models to address the replica placement problem. In our problem, the p-median model finds the locations of p candidate sites to place a replica to optimize the total (or average) response time. The p-center model hosts replicas to p candidate sites by minimizing the maximum response time among sites. A Grid environment is highly dynamic so placing a replica by considering one objective, i.e., optimize average response time or optimize maximum response time, may not be always a good choice. We propose a multi-objective model that considers the objectives of p-median and p-center simultaneously to select the candidate sites that will host replicas. Simulation results demonstrate that the multi-objective model outperforms single objective models in dynamic environments such as Data Grids.
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
Allcock, B., Bester, J., Bresnahan, J., Chervenak, A., Foster, I., Kesselman, C., Meder, S., Nefedova, V., Quesnel, D., Tuecke, S.: Secure, Efficient Data Transport and Replica Management for High Performance Data-Intensive Computing. In: Proc. of IEEE Mass Storage Conference (2001)
Bell, W., Cameron, D.G., Capozza, L., Millar, P., Stockinger, K., Zini, F.: OptorSim - A Grid Simulator for Studying Dynamic Data Replication Strategies. International Journal of High Performance Computing Applications 17(4) (2003)
Buyya, R., Abramson, D., Giddy, J., Nimrod, G.: An Architecture of a Resource Management and Scheduling System in a Global Computational Grid. In: Proc. of HPC Asia 2000, Beijing, China, pp. 283–289 (2000)
Cai, M., Chervenak, A., Frank, M.: A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table. In: Proc. of the SC 2004 Conference (November 2004)
Chervenak, A., Foster, I., Kesselman, C., Salisbury, C., Tuecke, S.: The Data Grid: Towards and Architecture for the Distributed Management and Analysis of Large Scientific Data Sets. Journal of Network and Computer Applications 23(3), 187–200 (2000)
Chervenak, A., Deelman, E., Foster, I., Guy, L., Hoschek, W., Iamnitchi, A., Kesselman, C., Kunszt, P., Ripeanu, M., Schwartzkopf, B., Stockinger, H., Stockinger, K., Tierney, B.: Giggle: A Framework for Constructing Scalable Replica Location Services. In: Proceedings of the Supercomputing Conference (2002)
Cohon, J.L.: Multiobjective Programming and Planning. Academic Press, New York (1978)
Daskin., M.S.: Network and Discrete Location Models: Algorithms and Applications. John Wiley & Sons, Chichester (1995)
Drezner, Z., Hamacher, H.W.: Facility Location Applications and Theory. Springer, Berlin (2002)
Fisher, M.L.: The Lagrangian relaxation method for solving integer programming problems. Management Sciences 27, 1–18
Foster, I.: Internet Computing and the Emerging Grid. Nature Web Matters (2000)
The GriPhyN Project, http://www.griphyn.org
Hakami, S.: Optimum location of switching centers and the absolute centers and medians of a graph. Operations Research 12, 450–459
Kavitha, R., Foster, I.: Design and Evaluation of Replication Strategies for a High Performance Data Grid. Computing and High Energy and Nuclear Physics (2001)
Kavitha, R., Iamnitchi, A., Foster, I.: Improving Data Availability through Dynamic Model Driven Replication in Large Peer-to-Peer Communities. In: Proc. of Global and Peer-to-Peer Computing on Large Scale Distributed Systems Workshop, Berlin (May 2002)
Kavitha, R., Foster, I.: Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications. In: Proc. of IEEE International Symposium on High Performance Distributed Computing, Edinburgh (July 2002)
Marglin, S.: Public Investment Criteria, p. 103. MIT Press, Cambridge
Rahman, R.M., Barker, K., Alhajj, R.: Replica Placement on Data Grid: Considering Utility and Risk. In: Proc. of IEEE International Conference on Coding and Computing (April 2005)
Revees, C.R. (ed.): Modern Heuristic Techniques for Combinatorial Problems. Oxford Blackwell Scientific Publication, Malden (1993)
Toregas, C., Swain, R., Revelle, C., Bergman, L.: The location of emergency service facile ties. Operations Research 19, 1363–1373
Zhao, Y., Hu, Y.: Gress - a Grid Replica Selection Service. In: Proc. of ICSA Parallel and Distributed Computing Systems (2003)
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
Rahman, R.M., Barker, K., Alhajj, R. (2005). Replica Placement in Data Grid: A Multi-objective Approach. In: Zhuge, H., Fox, G.C. (eds) Grid and Cooperative Computing - GCC 2005. GCC 2005. Lecture Notes in Computer Science, vol 3795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590354_82
Download citation
DOI: https://doi.org/10.1007/11590354_82
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30510-1
Online ISBN: 978-3-540-32277-1
eBook Packages: Computer ScienceComputer Science (R0)