Article: Performance evaluation of different replica placement algorithms Journal: International Journal of Grid and Utility Computing (IJGUC) 2009 Vol.1 No.2 pp.121 - 133 Abstract: One of the challenges for data replication in a Data Grid is to select the candidate sites that will host the replicas of datasets. In our earlier research (Rahman et al., 2006, May; Rahman et al., 2007, May), we propose different replica placement algorithms based on three mathematical models, i.e. p-centre, p-median and a multi-objective models. We also present a replica maintenance algorithm to relocate replicas to different sites if the performance of the replica host sites degrades significantly. In this research, we validate our replica placement algorithms with different performance metrics, e.g. total file transfer time, the number of local and remote file access, with accuracy. To evaluate our replica placement algorithms, we use a Data Grid simulator called OptorSim (Bell et al., 2003). This paper presents detailed execution flows of the replication algorithms in the simulator. The study of our replica placement algorithms is carried out using a model of the EU Data Grid Testbed 1 (Bell et al., 2003) sites and the associated network geometry. Jobs are based on the CDF use-case as described in Huffman et al. (2002). Inderscience Publishers - linking academia, business and industry through research

Title: Performance evaluation of different replica placement algorithms

Authors: Rashedur M. Rahman, Ken Barker, Reda Alhajj

Addresses: Department of Computer Science and Engineering, North South University, Dhaka, Bangladesh. ' Department of Computer Science, University of Calgary, Alberta, Canada. ' Department of Computer Science, University of Calgary, Alberta, Canada; Department of Computer Science, Global University, Beirut, Lebanon

Abstract: One of the challenges for data replication in a Data Grid is to select the candidate sites that will host the replicas of datasets. In our earlier research (Rahman et al., 2006, May; Rahman et al., 2007, May), we propose different replica placement algorithms based on three mathematical models, i.e. p-centre, p-median and a multi-objective models. We also present a replica maintenance algorithm to relocate replicas to different sites if the performance of the replica host sites degrades significantly. In this research, we validate our replica placement algorithms with different performance metrics, e.g. total file transfer time, the number of local and remote file access, with accuracy. To evaluate our replica placement algorithms, we use a Data Grid simulator called OptorSim (Bell et al., 2003). This paper presents detailed execution flows of the replication algorithms in the simulator. The study of our replica placement algorithms is carried out using a model of the EU Data Grid Testbed 1 (Bell et al., 2003) sites and the associated network geometry. Jobs are based on the CDF use-case as described in Huffman et al. (2002).

Keywords: data grid; replication; network latency; dynamic allocation; distributed environments;replica placement algorithms; grid computing; simulation; performance evaluation.

DOI: 10.1504/IJGUC.2009.022028

International Journal of Grid and Utility Computing, 2009 Vol.1 No.2, pp.121 - 133

Received: 03 Dec 2007
Accepted: 23 Jan 2008
Published online: 16 Dec 2008 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: Performance evaluation of different replica placement algorithms

Keep up-to-date