Throughput and Delay Analysis of Database Replication Algorithm

Full Text (PDF, 467KB), PP.47-53

Views: 0 Downloads: 0


Sanjay Kumar Yadav 1,* Gurmit Singh 1 Divakar Singh Yadav 2

1. Dept. of Computer Science & Information Technology, Sam Higginbottom Institute Of Agriculture, Technology & Sciences, Allahabad , India

2. Department of Computer Science & Engineering, Institute of Engineering and Technology, Lucknow., India

* Corresponding author.


Received: 25 Aug. 2013 / Revised: 4 Oct. 2013 / Accepted: 5 Nov. 2013 / Published: 8 Dec. 2013

Index Terms

Database replication, throughput, average delay.


Recently, (PDDRA) a Pre-fetching based dynamic data replication algorithm has been published. In our previous work, modifications to the algorithm have been suggested to minimize the delay in data replication. In this paper a mathematical framework is presented to evaluate mean waiting time before data can be replicated on the requested site. The idea is further investigated and simulation results are presented to estimate the throughput and average delay.

Cite This Paper

Sanjay Kumar Yadav, Gurmit Singh, Divakar Singh Yadav, "Throughput and Delay Analysis of Database Replication Algorithm", International Journal of Modern Education and Computer Science (IJMECS), vol.5, no.12, pp.47-53, 2013. DOI:10.5815/ijmecs.2013.12.07


[1]R.Elmasri and S. B. Navathe. Fundamentals of Database Systems [B]. The Benjamin/Cummings Publishing Company, Inc., 1994.
[2]Fredrik Nilsson, Patrik Olsson. A survey on reliable communication and replication techniques for distributed databases [B].
[3]A. Dogan, A study on performance of dynamic file replication algorithms for real-time file access in data grids, [J] Future Generation Computer Systems 2009, 25 (8): 829–839
[4]R. S. Chang, P. H. Chen, Complete and fragmented selection and retrieval in data grids, [J] Future Generation Computer Systems, 2007, 23 : 536–546.
[5]Marius Cristian MAZILU, "Database Replication", [J] Database Systems Journal 2010, 1(2), 33-38.
[6]I. Foster, K. Ranganathan, Design and evaluation of dynamic replication strategies a high performance Data Grid, [C] in: Proceedings of International Conference on Computing in High Energy and Nuclear Physics, China, September 2001.
[7]M. Tang, B.S. Lee, C.K. Yao, X.Y Tang, Dynamic replication algorithm for the multi-tier data grid, [J] Future Generation Computer Systems 2005, 21 (5) : 775–790.
[8]M. Shorfuzzaman, P. Graham, R. Eskicioglu, Popularity-driven dynamic replica placement in hierarchical data grids, [C] in: Proceedings of Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies, 2008, 524–531.
[9]R.-S. Chang, H.-P. Chang, Y.-T. Wang, A dynamic weighted data replication strategy in data grids, [J] The Journal of Supercomputing, 2008, 45 (3) : 277–295.
[10]A.R. Abdurrab, T. Xie, FIRE: a file reunion data replication strategy for data grids, [C] in: 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing, 2010, 215–223.
[11]K. Sashi, A.S. Thanamani, Dynamic replication in a data grid using a modified BHR region based algorithm, [J] Future Generation Computer Systems 2010, 27: 202–210.
[12]Yair Amir, Claudiu Danilov, Michal Miskin-Amir, Jonathan Stanton and Ciprian Tutu. Practical Wide-Area Database Replication [R]. Technical Report CNDS-2002-1 Johns Hopkins University,
[13]Y. Amir. Replication Using Group Communication Over a Partitioned Network. Ph.D. thesis, The Hebrew University of Jerusalem, Israel 1995.
[14]N.Saadat and A.M. Rahmani. PDDRA: A new pre-fetching based dynamic data replication algorithm in data grids. [J] Springer: Future Generation Computer Systems, 2012, 28:666-681.
[15]Sanjay Kumar Yadav, Gurmit Singh, Divakar Singh Yadav, “Mathematical Framework for A Novel Database Replication Algorithm”,[J] International Journal of Modern Education and Computer Science (IJMECS), vol. 5, no. 9, pp. 1-10, 2013, DOI:10.5815.