Cooperative Data Caching for Cloud Data Servers

Authors

DOI:

https://doi.org/10.4108/eai.9-8-2016.151632

Keywords:

cloud data centers, data allocation, mixed integer programming

Abstract

Thanks to the advance of cloud computing technologies, users can access the data stored at cloud data centers at any time and from any where. However, the data centers are usually sparsely distributed over the Internet and are far away from end users. In this paper, we consider to construct a cache network by a large number of cache nodes close to the end users in order to minimize the data access delay.We firstly formulate the problem of placing the replicas of data items to cache nodes as a mixed integer programming (MIP) problem. Then, we proposed an efficient heuristic algorithm that allocates at least one replica of each data item in the cache network and attempt to allocate more data items so as to minimize the total data access cost. The simulation results show that our proposed algorithm behaves much better than a well-known LRU algorithm and the computation complexity is limited.

Downloads

Published

09-08-2016

How to Cite

1.
Yang M, Guo K, Zhang Y. Cooperative Data Caching for Cloud Data Servers. EAI Endorsed Scal Inf Syst [Internet]. 2016 Aug. 9 [cited 2024 Nov. 22];3(8):e3. Available from: https://publications.eai.eu/index.php/sis/article/view/2286