Advertisement

Quorum Based Data Replication in Grid Environment

  • Rohaya Latip
  • Hamidah Ibrahim
  • Mohamed Othman
  • Md Nasir Sulaiman
  • Azizol Abdullah
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5009)

Abstract

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 2D 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 2D mesh network 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.

Keywords

Data replication Grid Data management Availability Replica control protocol 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Krauter, K., Buyya, R., Maheswaran, M.: A Taxanomy and Survey of Grid Resource Management Systems for Distributed Computing. International Journal of Software Practice and Experience 32(2), 135–164 (2002)zbMATHCrossRefGoogle Scholar
  2. 2.
    Foster, I., Kesselman, C., Nick, J., Tuecke, S.: Grid Services for Distributed System Integration. Computer 35(6), 37–46 (2002)CrossRefGoogle Scholar
  3. 3.
    Ranganathan, K., Foster, I.: Identifying Dynamic Replication Strategies for a High Performance Data Grid. In: International Workshop on Grid Computing, Denver (2001)Google Scholar
  4. 4.
    Lamehamedi, H., Szymanski, B., Shentu, Z., Deelman, E.: Data Replication Strategies in Grid Environment. In: ICAP 2003, pp. 378–383. IEEE Computer Science Press, Los Alamitos (2002)Google Scholar
  5. 5.
    Lamehamedi, H., Shentu, Z., Szymanski, B.: Simulation of Dynamic Data Replication Strategies in Data Grids. In: The 17th International Symposium on Parallel and Distributed Processing, pp. 22–26 (2003)Google Scholar
  6. 6.
    Lamehamedi, H.: Decentralized Data Management Framework for Data Grids. Ph.D. thesis, Rensselaer Polytechnic Institute Troy, New York (2005)Google Scholar
  7. 7.
    Agrawal, D., El Abbadi, A.: Using Reconfiguration for Efficient Management of Replicated Data. IEEE Transactions on Knowledge and Data Engineering 8(5), 786–801 (1996)CrossRefGoogle Scholar
  8. 8.
    Mat Deris, M.: Efficient Access of Replication Data in Distributed Database Systems. Thesis PhD, Universiti Putra Malaysia (2001)Google Scholar
  9. 9.
    Agrawal, D., El Abbadi, A.: The Generalized Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data. ACM Transactions Database System 17(4), 689–717 (1992)CrossRefGoogle Scholar
  10. 10.
    Agrawal, D., El Abbadi, A.: The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data. In: 16th International Conference on Very Large databases, pp. 243–254 (1990)Google Scholar
  11. 11.
    Maekawa, M.: A √n Algorithm for Mutual Exclusion in Decentralized Systems. ACM Transactions Computer System 3(2), 145–159 (1992)CrossRefGoogle Scholar
  12. 12.
    Cheung, S.Y., Ammar, M.H., Ahmad, M.: The Grid Protocol: A High Performance Schema for Maintaining Replicated Data. IEEE Transactions on Knowledge and Data Engineering 4(6), 582–592 (1992)CrossRefGoogle Scholar
  13. 13.
    Mat Deris, M., Evans, D.J., Saman, M.Y., Ahmad, N.: Binary Vote Assignment on Grid For Efficient Access of Replicated Data. Int’l Journal of Computer Mathematics, 1489–1498 (2003)Google Scholar
  14. 14.
    Mat Deris, M., Abawajy, J.H., Suzuri, H.M.: An Efficient Replicated Data Access Approach for Large Scale Distributed Systems. In: IEEE/ACM Conf. on Cluster Computing and Grid, Chicago, USA (2004)Google Scholar
  15. 15.
    Ahamad, N., Mat Deris, M.: Managing Neighbor Replication Transactions in Distributed Systems. In: DCABES 2006, China (2006)Google Scholar
  16. 16.
    Kunszt, P., Laure, E., Stockinger, H., Stockinger, K.: Advanced Replica Management with Reptor. In: CERN, European Organization for Nuclear Research, CH-1211 Geneva 23, Switzerland (2000)Google Scholar
  17. 17.
    Mat Deris, M., Abawajy, J.H., Mamat, A.: An Efficient Replicated Data Access Approach for Large-scale Distributed Systems. Future Generation Computer Systems 24, 1–9 (2007)CrossRefGoogle Scholar
  18. 18.
    Jimenez-Peris, R., et al.: Are Quorums an Alternative for Data Replication? ACM Transactions on Database Systems 28(3) (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Rohaya Latip
    • 1
  • Hamidah Ibrahim
    • 1
  • Mohamed Othman
    • 1
  • Md Nasir Sulaiman
    • 1
  • Azizol Abdullah
    • 1
  1. 1.Faculty of Computer Science and Information TechnologyUniversiti Putra Malaysia 

Personalised recommendations