{"references": ["O. Marin, \"The darx framework: Adapting fault tolerance for agent\nsystems,\" Ph.D. dissertation, Universit\u00b4e de Have, 2003.", "B. Hamid, \"Distributed fault-tolerance techniques for local\ncomputations,\" Ph.D. dissertation, Universit\u00b4e Bordeaux I, 2007.", "F. Reichenbach, \"Service snmp de dtection de faute pour des systmes\nrpartis,\" Ph.D. dissertation, Ecole polytechnique de Lausane, 2002.", "M. Wiesmann, F. Pedone, and A. Schiper, \"A systematic classification\nof replicated database protocols based on atomic broadcast,\" in 3rd\nEuropeean Research Seminar on Advances in Distributed Systems, 1999.", "X. Besseron, \"Tol\u00b4erance aux fautes et reconfiguration dynamique\npour les applications distribu\u00b4ees `a grande \u00b4echelle,\" Ph.D. dissertation,\nUniversit\u00b4e de Grenoble, 2010.", "N. M. Ndiaye, \"Techniques de gestion des d\u00b4e faillances dans les grilles\ninformatiques tol\u00b4e rantes aux fautes,\" Ph.D. dissertation, Universit\u00b4e\nPierre et Marie Curie, 2013.", "S. Drapeau, \"Un canevas adaptable de services de duplication,\" Ph.D.\ndissertation, Institut National Polytechnique de Grenoble, 2003.", "R. Souli-Jbali, M. S. Hidri, and R. B. Ayed, \"Dynamic data\nreplication-driven model in data grids,\" in 39th Annual Computer\nSoftware and Applications Conference, COMPSAC Workshops 2015,\nTaichung, Taiwan, July 1-5, 2015, 2015, pp. 393\u2013397.", "Chandy and Lamport, \"Distributed snapshots : Determining global states\nof distributed systems,\" ACM Transactions on Computer Systems, vol. 3,\nno. 1, pp. 63\u201375, 1985.\n[10] H. S.Paul, A. Gupta, and R. Badrinath, \"Hierarchical coordinated\ncheckpointing protocol,\" in International Conference on Parallel and\nDistributed Computing Systems, 2002, pp. 240\u2013245.\n[11] K. Bhatia, K. Marzullo, and L. Alvisi, \"Scalable causal message logging\nfor wide-area environments,\" Concurrency and Computation: Practice\nand Experience, vol. 15, no. 3, pp. 243\u2013250, 2003.\n[12] S. Monnet, C. Morin, and R. Badrinath, \"Hybrid checkpointing for\nparallel applications in cluster federations,\" in 3rd Workshop on\nResiliency in High Performance Computing (Resilience) in Clusters,\nClouds, and Grids, 2004, pp. 773\u2013782.\n[13] E. Meneses, C. L. Mendes, and L. V. Kale, \"Team based message\nlogging : Preliminary results,\" in 4th IEEE ACM International\nSymposium on Cluster Computing and the Grid, 2010.\n[14] J.-M. Yang, K. Li, W.-W. Li, and D.-F. Zhang, \"Trading off logging\noverhead and coordinating overhead to achieve efficient rollback\nrecovery,\" Concurrency and Computation: Practice and Experience,\nvol. 21, no. 3, pp. 819\u2013853, 2009.\n[15] A. Guermouche, \"Nouveaux protocoles de tolrance aux fautes pour les\napplications du calcul haute performance,\" Ph.D. dissertation, Universit\u00b4e\nParis-Sud, 2011.\n[16] D. B. Johnson and W. Zwaenepoel, \"Sender based message logging,\"\nin The Seventeenth Annual International Symposium on Fault-Tolerant\nComputing, 1987, pp. 14\u201319.\n[17] A. Varga and R. Hornig, \"An overview of the omnet++ simulation\nenvironment,\" in Proceedings of the 1st International Conference on\nSimulation Tools and Techniques for Communications, Networks and\nSystems & Workshops, 2008, pp. 60:1\u201360:10."]}

Grid of computing nodes has emerged as a representative means of connecting distributed computers or resources scattered all over the world for the purpose of computing and distributed storage. Since fault tolerance becomes complex due to the availability of resources in decentralized grid environment, it can be used in connection with replication in data grids. The objective of our work is to present fault tolerance in data grids with data replication-driven model based on clustering. The performance of the protocol is evaluated with Omnet++ simulator. The computational results show the efficiency of our protocol in terms of recovery time and the number of process in rollbacks.