Abstract
Current replication strategies update replicas by analyzing the data access pattern for a certain period of time. Therefore, the access latency temporarily increases due to delayed responses to changing data access pattern during the interval of updating replicas. Thus, we propose a real-time data replication strategy that can update a replica by reflecting changes in the data access patterns in real time to solve this problem. The proposed replication strategy introduces a priority value (PV) as a criterion to generate and delete replicas in real time. The PV is calculated based on the previous data access patterns and is updated in real time. We perform simulations to evaluate the performance of the proposed replication strategy by comparing it with the popular file replicate first algorithm (PFRF). The simulation results show that the average job execution time of the proposed strategy is shorter than that of the PFRF by 34.0---38.0%.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
