By Topic

Dynamic replica replacement strategy in data grid

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
$33 $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

6 Author(s)
Alexis M. Soosai ; Department of Communication Technology and Network, Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, Serdang, Malaysia ; Azizol Abdullah ; Mohamed Othman ; Rohaya Latip
more authors

Data replication strategy is widely adopted for large scale data-intensive applications in distributed network such as data grid. Replication approach can shorten the time of fetching the files by creating many replicas stored in appropriate sites. However, due to the limited storage capacity of each node, replicas that are beneficial for future jobs can be wastefully removed and replaced with less valuable ones. Therefore, it is important to have efficient replication optimization that can dynamically choose the replicas for replacement while satisfying Quality of Service (QoS) requirements and storage capacity constraints. In this paper, we present a dynamic replica replacement strategy, named Least Value Replacement (LVR), which can ascertain the importance of valuable replicas in a grid site. The LVR algorithms can automatically decide on which replica to be replaced whenever the storage element of the grid site is full based on information such as access frequency and files future value. The performance evaluation of LVR and other replication algorithms are carried out by simulation. The result shows that LVR performs better than other replication strategies. Thus, the contribution of this paper provides another aspect of replication strategy by minimizing the job execution time for overall data grid performance.

Published in:

Computing Technology and Information Management (ICCM), 2012 8th International Conference on  (Volume:2 )

Date of Conference:

24-26 April 2012