Performance evaluation of different replica placement algorithms
by Rashedur M. Rahman, Ken Barker, Reda Alhajj
International Journal of Grid and Utility Computing (IJGUC), Vol. 1, No. 2, 2009

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).

Online publication date: Tue, 16-Dec-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email