sis 16(8): e3

Research Article

Cooperative Data Caching for Cloud Data Servers

Download722 downloads
  • @ARTICLE{10.4108/eai.9-8-2016.151632,
        author={Mingcong Yang and Kai Guo and Yongbing Zhang},
        title={Cooperative Data Caching for Cloud Data Servers},
        journal={EAI Endorsed Transactions on Scalable Information Systems},
        volume={3},
        number={8},
        publisher={EAI},
        journal_a={SIS},
        year={2016},
        month={8},
        keywords={cloud data centers, data allocation, mixed integer programming},
        doi={10.4108/eai.9-8-2016.151632}
    }
    
  • Mingcong Yang
    Kai Guo
    Yongbing Zhang
    Year: 2016
    Cooperative Data Caching for Cloud Data Servers
    SIS
    EAI
    DOI: 10.4108/eai.9-8-2016.151632
Mingcong Yang1,*, Kai Guo1, Yongbing Zhang1
  • 1: Graduate School of Systems and Information Engineering, University of Tsukuba, Japan
*Contact email: s1520548@sk.tsukuba.ac.jp

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.