Replica Placement Strategies in Data Grid |
| |
Authors: | Rashedur M Rahman Ken Barker Reda Alhajj |
| |
Affiliation: | (1) Department of Computer Science, University of Calgary, Calgary, Alberta, Canada |
| |
Abstract: | Replication is a technique used in Data Grid environments that helps to reduce access latency and network bandwidth utilization.
Replication also increases data availability thereby enhancing system reliability. The research addresses the problem of replication
in Data Grid environment by investigating a set of highly decentralized dynamic replica placement algorithms. Replica placement
algorithms are based on heuristics that consider both network latency and user requests to select the best candidate sites
to place replicas. Due to dynamic nature of Grid, the candidate site holds replicas currently may not be the best sites to
fetch replicas in subsequent periods. Therefore, a replica maintenance algorithm is proposed to relocate replicas to different
sites if the performance metric degrades significantly. The study of our replica placement algorithms is carried out using
a model of the EU Data Grid Testbed 1 Bell et al. Comput. Appl., 17(4), 2003] sites and their associated network geometry. We validate our replica placement
algorithms with total file transfer times, the number of local file accesses, and the number of remote file accesses. |
| |
Keywords: | Data Grid Replication Network latency Dynamic allocation Distributed environment |
本文献已被 SpringerLink 等数据库收录! |
|