Authors: Xiuguo Wu; Wei Su
Addresses: School of Management Science and Engineering, Shandong University of Finance and Economics, SDUFE, No. 7366, Erhuan East Road, LiXia District, Jinan, 250014, China ' School of Management Science and Engineering, Shandong University of Finance and Economics, SDUFE, No. 7366, Erhuan East Road, LiXia District, Jinan, 250014, China
Abstract: In cloud computing environment, especially data-intensive systems, large amounts of datasets are stored in distributed data centres, and are often retrieved by users in different regions. To reduce the users' response time, replicating the popular datasets to multiple suitable data centres is an advisable choice, as tasks can access the datasets from a nearby site. Nevertheless, the dataset replicas' suitable storage placement selection is still an important issue that should be solved urgently from the response time constraint view, for the reason that too many replicas are infeasible in practice. In this paper, we first propose a comprehensive dataset response time estimation model, then present a replica placement model based on Steiner tree. After that, an approximate replica placement algorithm under a response time constraint in the cloud is given using Kruskal minimum spanning tree. At last, a practical and reasonable performance evaluation is designed and implemented. Both the theoretical analysis and simulations conducted on general (random) datasets show the efficiency and effectiveness of the proposed strategy in the cloud.
Keywords: cloud computing; cloud storage; data; replicas placements; response time constraint; wait access latency; average wait access latency; data transfer time; Kruskal minimum spanning tree; Steiner tree.
International Journal of Information Technology and Management, 2019 Vol.18 No.1, pp.74 - 92
Available online: 13 Feb 2019 *Full-text access for editors Access for subscribers Purchase this article Comment on this article