Quorum-based Data Replication in Grid Environment

被引:1
作者
Latip, Rohaya [1 ]
Othman, Mohamed [1 ]
Abdullah, Azizol [1 ]
Ibrahim, Hamidah [2 ]
Sulaiman, Md Nasir [2 ]
机构
[1] Univ Putra Malaysia, Dept Technol Commun & Network, Fac Comp Sci & Informat Technol, Serdang 43400, Selangor, Malaysia
[2] Univ Putra Malaysia, Dept Comp Sci, Fac Comp Sci & Informat Technol, Serdang 43400, Selangor, Malaysia
关键词
Data Replication; Grid; Data Management; Availability; Replica Control Protocol; ALGORITHM; PROTOCOL;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Replication is a useful technique for distributed database systems and can be implemented in a grid computation environment to provide a high availability, fault tolerant, and enhance the performance of the system. This paper discusses a new protocol named Diagonal Data Replication in 2D Mesh structure (DR2M) protocol where the performance addressed are data availability which is compared with the previous replication protocols, Read-One Write-All (ROWA), Voting (VT), Tree Quorum (TQ), Grid Configuration (GC), and Neighbor Replication on Grid (NRG). DR2M protocol is organized in a logical two dimensional mesh structure and by using quorums and voting techniques to improve the performance and availability of the replication protocol where it reduce the number of copies of data replication for read or write operations. The data file is copied at the selected node of the diagonal site in a quorum. The selection of a replica depends on the diagonal location of the structured two dimensional mesh quorum where the middle node is selected because it is the best location to get a copy of the data if every node has the equal number of request and data accessing in the network. The algorithm in this paper also calculates the best number of nodes in each quorum and how many quorums are needed for N number of nodes in a network. DR2M protocol also ensures that the data for read and write operations is consistency, by proofing the quorum must not have a nonempty intersection quorum. To evaluate DR2M protocol, we developed a simulation model in Java. Our results prove that DR2M protocol improves the performance of the data availability compare to the previous data replication protocol, ROWA, VT, TQ, GC and NRG.
引用
收藏
页码:386 / 397
页数:12
相关论文
共 33 条
[1]   THE GENERALIZED TREE QUORUM PROTOCOL - AN EFFICIENT APPROACH FOR MANAGING REPLICATED DATA [J].
AGRAWAL, D ;
ELABBADI, A .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1992, 17 (04) :689-717
[2]   Using reconfiguration for efficient management of replicated data [J].
Agrawal, D ;
ElAbbadi, A .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1996, 8 (05) :786-801
[3]  
AGRAWAL D, 1990, VERY LARGE DATA BASES, P243
[4]  
AHMAD N, 2007, AM J APPL SCI, V4, P748
[5]  
Ahmad N, 2006, DCABES 2006 PROCEEDINGS, VOLS 1 AND 2, P95
[6]   AN ALGORITHM FOR CONCURRENCY-CONTROL AND RECOVERY IN REPLICATED DISTRIBUTED DATABASES [J].
BERNSTEIN, PA ;
GOODMAN, N .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1984, 9 (04) :596-615
[7]  
BUDIARTO S, 2002, DATA KNOWLEDGE ENG E, V41, P391
[8]   THE GRID PROTOCOL - A HIGH-PERFORMANCE SCHEME FOR MAINTAINING REPLICATED DATA [J].
CHEUNG, SY ;
AMMAR, MH ;
AHAMAD, M .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1992, 4 (06) :582-592
[9]  
CHUNG SM, 1993, P 3 INT C DAT SYST A, P83
[10]   Binary vote assignment on a grid for efficient access of replicated data [J].
Deris, MM ;
Evans, DJ ;
Saman, MY ;
Noraziah, A .
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2003, 80 (12) :1489-1498