Performance evaluation of different replica placement algorithms

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

[1]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[2]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[3]  Jared L. Cohon,et al.  Multiobjective programming and planning , 2004 .

[4]  G. O. Wesolowsky,et al.  The Multiperiod Location-Allocation Problem with Relocation of Facilities , 1975 .

[5]  Min Cai,et al.  A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table , 2004, Proceedings of the ACM/IEEE SC2004 Conference.

[6]  Kavitha Ranganathan,et al.  Decoupling computation and data scheduling in distributed data-intensive applications , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[7]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[8]  Reda Alhajj,et al.  Study of Different Replica Placement and Maintenance Strategies in Data Grid , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[9]  Kurt Stockinger,et al.  OptorSim-A Grid Simulator for Studying Dynamic Data Replication Strategies , 2003 .

[10]  Reda Alhajj,et al.  Replica placement design with static optimality and dynamic maintainability , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[11]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[12]  Kavitha Ranganathan,et al.  Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).