Managing data using neighbor replication on triangular-grid structure

Authors:
Ali Mamat;M. Mat Deris;J. H. Abawajy;Suhaila Ismail
Affiliations:
Faculty of Computer Science and Information technology, University Putra Malaysia, Serdang, Selangor, Malaysia;Faculty of Information technology and Multimedia, University College of Tun Hussein Onn, Parit Raja, Batu Pahat, Johor;School of Information Technology, Deakin University, Geelong, VIC, Australia;Faculty of Computer Science and Information technology, University Putra Malaysia, Serdang, Selangor, Malaysia
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Year:
2006

Citing 9
Cited 1

An adaptive data replication algorithm

ACM Transactions on Database Systems (TODS)
Performance Modeling of Distributed and Replicated Databases

IEEE Transactions on Knowledge and Data Engineering
Data management issues in mobile and peer-to-peer environments

Data & Knowledge Engineering - DKE 40
Distributed Database Management Systems and the Data Grid

MSS '01 Proceedings of the Eighteenth IEEE Symposium on Mass Storage Systems and Technologies
Epidemic Algorithms for Replicated Databases

IEEE Transactions on Knowledge and Data Engineering
Improving Availability and Performance with Application-Specific Data Replication

IEEE Transactions on Knowledge and Data Engineering
An efficient replicated data access approach for large-scale distributed systems

CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
File-based replica management

Future Generation Computer Systems
Improved grid information service using the idea of file-parted replication

ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications

Neighbor-Replica Distribution Technique Model for Availability Prediction in Distributed Interdependent Environment

International Journal of Cloud Applications and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data is one of the domains in grid research that deals with the storage, replication, and management of large data sets in a distributed environment. The all-data-to-all sites replication scheme such as read-one write-all and tree grid structure (TGS) are the popular techniques being used for replication and management of data in this domain. However, these techniques have its weaknesses in terms of data storage capacity and also data access times due to some number of sites must ‘agree’ in common to execute certain transactions. In this paper, we propose the all-data-to-some-sites scheme called the neighbor replication on triangular grid (NRTG) technique by considering only neighbors have the replicated data, and thus, minimizes the storage capacity as well as high update availability. Also, the technique tolerates failures such as server failures, site failure or even network partitioning using remote procedure call (RPC).