By Topic

Optimal Placement Replication on Data Grid Environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Garmehi, M. ; Bojnourd Univ., Bojnourd ; Mansouri, Y.

Data replication is one of the best-known strategies to achieve high levels of availability and fault tolerance, as well as minimal access times for large, distributed user communication using a worldwide data grid (DG). One of the challenges in data replication is to select the candidate sites where replicas should be placed and which are known as optimal placement of replicas (OPR). In this paper we propose an algorithm, which is formulated by using dynamic programming method to find optimal placement k replicas of an object over DG systems, such that the overall cost (i.e. storage cost plus read cost is minimized. We have also proposed a sketch of the proof for our algorithm and its integrity.

Published in:

Information Technology, (ICIT 2007). 10th International Conference on

Date of Conference:

17-20 Dec. 2007