Abstract
In this paper, we study the quality-of-service (QoS)-aware replica placement problem in grid environments. Although there has been much work on the replica placement problem in parallel and distributed systems, most of them concern average system performance and have not addressed the important issue of quality of service requirement. In the very few existing work that takes QoS into consideration, a simplified replication model is assumed; therefore, their solution may not be applicable to real systems. In this paper, we propose a more realistic model for replica placement, which consider storage cost, update cost, and access cost of data replication, and also assumes that the capacity of each replica server is bounded.
The QoS-aware replica placement is NP-complete even in the simple model. We propose two heuristic algorithms, called greedy remove and greedy add to approximate the optimal solution. Our extensive experiment results demonstrate that both greedy remove and greedy add find a near-optimal solution effectively and efficiently. Our algorithms can also adapt to various parallel and distributed environments.
Similar content being viewed by others
References
GT Internetwork Topology Models (GT-ITM) (2000) http://www-static.cc.gatech.edu/projects/gtitm/
Chervenak A, Schuler R, Kesselman C, Koranda S, Moe B (2005) Wide area data replication for scientific collaborations. In: Proceedings of the 6th international workshop on grid computing, November 2005
Cidon I, Kutten S, Soffer R (2001) Optimal allocation of electronic content. In: INFOCOM, pp 1773–1780
David WB (2003) Evaluation of an economy-based file replication strategy for a data grid. In: International workshop on agent based cluster and grid computing, pp 120–126
David WB, Cameron DG, Capozza L, Millar AP, Stocklinger K, Zini F (2002) Simulation of dynamic grid rdeplication strategies in optorsim. In: Proceedings of 3rd international IEEE workshop on grid computing, pp 46–57
Deris MM, Abawajy JH, Suzuri HM (2004) An efficient replicated data access approach for large-scale distributed systems. In: IEEE international symposium on cluster computing and the grid, April 2004
Hoschek W, Janez FJ, Samar A, Stockinger H, Stockinger K (2000) Data management in an international data grid project. In: Proceedings of GRID workshop, pp 77–90
Jeon WJ, Gupta I, Nahrstedt K (2005) Qos-aware object replication in overlay networks
Jia X, Li D, Hu X-D, Du D-Z (2001) Placement of read-write web proxies in the Internet. In: ICDCS, pp 687–690
Kalpakis K, Dasgupta K, Wolfson O (2001) Optimal placement of replicas in trees with read, write, and storage costs. IEEE Trans Parallel Distrib Syst 12(6):628–637
Krick C, Räcke H, Westermann M (2001) Approximation algorithms for data management in networks. In: SPAA ’01: Proceedings of the thirteenth annual ACM symposium on parallel algorithms and architectures. ACM Press, New York, pp 237–246
Lamehamedi H, Szymanski B, Shentu Z, Deelman E (2002) Data replication strategies in grid environments. In: Proceedings of 5th international conference on algorithms and architecture for parallel processing, pp 378–383
Ranganathan K, Iamnitchi A, Foste IT (2002) Improving data availability through dynamic model-driven replication in large peer-to-peer communities. In: 2nd IEEE/ACM international symposium on cluster computing and the grid, pp 376–381
Ranganathana K, Foster I (2001) Identifying dynamic replication strategies for a high performance data grid. In: Proceedings of the international grid computing workshop, pp 75–86
Stockinger H, Samar A, Allcock B, Foster I, Holtman K, Tierney B (2001) File and object replication in data grids. In: 10th IEEE symposium on high performance and distributed computing, pp 305–314
Tang X, Xu J (2005) Qos-aware replica placement for content distribution. IEEE Trans Parallel Distrib Syst 16(10):921–932
Tu M, Li P, Ma Q, Yen I-L, Bastani FB (2005) On the optimal placement of secure data objects over Internet. In: IPDPS ’05: proceedings of the 19th IEEE international parallel and distributed processing symposium (IPDPS’05). IEEE Computer Society, Washington, p 14
Unger O, Cidon I (2004) Optimal content location in multicast based overlay networks with content updates. World Wide Web 7(3):315–336
Waxman BM (1991) Routing of multipoint connections, pp 347–352
Wolfson O, Milo A (1991) The multicast policy and its relationship to replicated data placement. ACM Trans Database Syst 16(1):181–205
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cheng, CW., Wu, JJ. & Liu, P. QoS-aware, access-efficient, and storage-efficient replica placement in grid environments. J Supercomput 49, 42–63 (2009). https://doi.org/10.1007/s11227-008-0221-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-008-0221-1