ANALYSIS OF A DATABASE REPLICATION ALGORITHM UNDER LOAD SHARING IN NETWORKS
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 simulation framework is presented and results are obtained to estimate th...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor's University
2016-02-01
|
| Series: | Journal of Engineering Science and Technology |
| Subjects: | |
| Online Access: | http://jestec.taylors.edu.my/Vol%2011%20issue%202%20February%202016/Volume%20(11)%20Issue%20(2)%20193-%20211.pdf |
| _version_ | 1828738493740744704 |
|---|---|
| author | SANJAY KUMAR YADAV GURMIT SINGH DIVAKAR SINGH YADAV |
| author_facet | SANJAY KUMAR YADAV GURMIT SINGH DIVAKAR SINGH YADAV |
| author_sort | SANJAY KUMAR YADAV |
| collection | DOAJ |
| description | 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 simulation framework is presented and results are obtained to estimate the throughput and average delay. The overall network is divided into two parts as local and global networks. The data requests are generated only at the local nodes. However, the service can be obtained form both local and global servers. In our previous work it has been found that the throughput and average delay heavily depends on buffer capacity of sever node and if server load is below 80% then, nearly 100% throughput is possible with very small average delay. In this paper, we have shown that shown the delay can be further minimized by sharing the load among servers, still throughput remains nearly 100 percent. |
| first_indexed | 2024-04-13T00:04:19Z |
| format | Article |
| id | doaj.art-25ee53b42eea45b99b16ab8e91fc94b0 |
| institution | Directory Open Access Journal |
| issn | 1823-4690 |
| language | English |
| last_indexed | 2024-04-13T00:04:19Z |
| publishDate | 2016-02-01 |
| publisher | Taylor's University |
| record_format | Article |
| series | Journal of Engineering Science and Technology |
| spelling | doaj.art-25ee53b42eea45b99b16ab8e91fc94b02022-12-22T03:11:16ZengTaylor's UniversityJournal of Engineering Science and Technology1823-46902016-02-01112193211ANALYSIS OF A DATABASE REPLICATION ALGORITHM UNDER LOAD SHARING IN NETWORKSSANJAY KUMAR YADAV0GURMIT SINGH1DIVAKAR SINGH YADAV2Department of Computer Science & IT, Sam Higginbottom Institute of Agriculture, Technology & Sciences, Allahabad, India Department of Computer Science & IT, Sam Higginbottom Institute of Agriculture, Technology & Sciences, Allahabad, India Department of Computer Science & Engineering, Institute of Engineering and Technology, Lucknow, IndiaRecently, (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 simulation framework is presented and results are obtained to estimate the throughput and average delay. The overall network is divided into two parts as local and global networks. The data requests are generated only at the local nodes. However, the service can be obtained form both local and global servers. In our previous work it has been found that the throughput and average delay heavily depends on buffer capacity of sever node and if server load is below 80% then, nearly 100% throughput is possible with very small average delay. In this paper, we have shown that shown the delay can be further minimized by sharing the load among servers, still throughput remains nearly 100 percent.http://jestec.taylors.edu.my/Vol%2011%20issue%202%20February%202016/Volume%20(11)%20Issue%20(2)%20193-%20211.pdfDatabase replicationThroughputAverage delay |
| spellingShingle | SANJAY KUMAR YADAV GURMIT SINGH DIVAKAR SINGH YADAV ANALYSIS OF A DATABASE REPLICATION ALGORITHM UNDER LOAD SHARING IN NETWORKS Journal of Engineering Science and Technology Database replication Throughput Average delay |
| title | ANALYSIS OF A DATABASE REPLICATION ALGORITHM UNDER LOAD SHARING IN NETWORKS |
| title_full | ANALYSIS OF A DATABASE REPLICATION ALGORITHM UNDER LOAD SHARING IN NETWORKS |
| title_fullStr | ANALYSIS OF A DATABASE REPLICATION ALGORITHM UNDER LOAD SHARING IN NETWORKS |
| title_full_unstemmed | ANALYSIS OF A DATABASE REPLICATION ALGORITHM UNDER LOAD SHARING IN NETWORKS |
| title_short | ANALYSIS OF A DATABASE REPLICATION ALGORITHM UNDER LOAD SHARING IN NETWORKS |
| title_sort | analysis of a database replication algorithm under load sharing in networks |
| topic | Database replication Throughput Average delay |
| url | http://jestec.taylors.edu.my/Vol%2011%20issue%202%20February%202016/Volume%20(11)%20Issue%20(2)%20193-%20211.pdf |
| work_keys_str_mv | AT sanjaykumaryadav analysisofadatabasereplicationalgorithmunderloadsharinginnetworks AT gurmitsingh analysisofadatabasereplicationalgorithmunderloadsharinginnetworks AT divakarsinghyadav analysisofadatabasereplicationalgorithmunderloadsharinginnetworks |