Data Caching in Next Generation Mobile Cloud Services
Yang Wang; Shuibing He; Xiaopeng Fan; Chengzhong Xu; Joseph Horton; Joseph Culberson
2017
会议日期2017
会议地点Bristol,UK
英文摘要In this paper we consider the data caching problem in next generation data services in the cloud, which is characterized by using monetary cost and access trajectory information to control cache replacements, instead of exploiting capacityoriented strategies as in traditional research. In particular, given a stream of requests to a shared data item with respect to a homogeneous cost model, we first propose a fast off-line algorithm using dynamic programming techniques. The proposed algorithm can generate optimal schedule within O(mn) timespace complexity to cache, migrate as well as replicate the shared data item to serve an n-length request sequence with minimum cost in a fully connected m-node network, substantially improving the previous results. Additionally, we also study this problem in its online form, and present a 3-competitive online algorithm by leveraging a speculative caching idea. The algorithm can serve an online request in constant time, and is space efficient in O(m) as well, rendering it to be more practical in reality. Our research complements the shortage of similar research in literature on this problem.
语种英语
内容类型会议论文
源URL[http://ir.siat.ac.cn:8080/handle/172644/12653]  
专题深圳先进技术研究院_数字所
作者单位2017
推荐引用方式
GB/T 7714
Yang Wang,Shuibing He,Xiaopeng Fan,et al. Data Caching in Next Generation Mobile Cloud Services[C]. 见:. Bristol,UK. 2017.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace