Abstract
Rather than replicating a file completely, Chang et al. proposed a fragmented replication technique to cope with the problem that only partial content of the replica are required in a local application. Furthermore, they also proposed two server selection algorithms for replica retrieval. However, their algorithms do not always find an optimal solution. To address the problem, in this paper, the authors propose a replica selection algorithm to improve the fragmented replica retrieval efficiency in this paper. It is a heuristic considering not only the transmission time but also the number of available servers for each block. Simulation results show that the proposed algorithm can improve the retrieval efficiency up to 12%.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Grid and High Performance Computing
Disclaimer: 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.
