Abstract-This paper studies the QoS-aware replica placement problem. Although there has been much work on replica placement problem, most of them concerns average system performance and ignores quality assurance issue. Quality assurance is very important, especially in heterogeneous environments. We propose a new heuristic algorithm that determines the positions of replicas in order to satisfy the quality requirements imposed by data requests. The experimental results indicate that the proposed algorithm finds a near-optimal solution effectively and efficiently for algorithm can also adapt to various parallel and distributed environments.
SUMMARYIn this paper, we consider the QoS-aware replica placement problem. Although there has been much research on the problem, most approaches focus on the average system performance and ignore the quality assurance issue. However, quality assurance is crucial, especially in heterogeneous environments. To fill this research gap, we proposed four heuristic algorithms to determine the locations of replicas in order to satisfy the quality requirements imposed by data requests. Three of the algorithms are greedy heuristics called Greedy-Cover, Cover-Partition and Multi-Source. The fourth algorithm is based on the Simulated Annealing technique. Our experiment results indicated that Greedy-Cover and the Simulated Annealing-based algorithms can find effective solutions efficiently.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.