Optimizing Data Placement for Cost Effective and High Available Multi-Cloud Storage

P. Wang, Caihui Zhao, Wenqiang Liu, Zhen Chen, Zhaohui Zhang
{"title":"Optimizing Data Placement for Cost Effective and High Available Multi-Cloud Storage","authors":"P. Wang, Caihui Zhao, Wenqiang Liu, Zhen Chen, Zhaohui Zhang","doi":"10.31577/cai_2020_1-2_51","DOIUrl":null,"url":null,"abstract":"With the advent of big data age, data volume has been changed from trillionbyte to petabyte with incredible speed. Owing to the fact that cloud storage offers the vision of a virtually infinite pool of storage resources, data can be stored and accessed with high scalability and availability. But a single cloud-based data storage has risks like vendor lock-in, privacy leakage, and unavailability. Multi-cloud storage can mitigate these risks with geographically located cloud storage providers. In this storage scheme, one important challenge is how to place a user's data cost-effectively with high availability. In this paper, an architecture for multi-cloud storage is presented. Next, a multi-objective optimization problem is defined to minimize total cost and maximize data availability simultaneously, which can be solved by an approach based on the non-dominated sorting genetic algorithm II (NSGA-II) and obtain a set of non-dominated solutions called the Pareto-optimal set. Then, a method is proposed which is based on the entropy method to determine the most suitable solution for users who cannot choose one from the Pareto-optimal set directly. Finally, the performance of the proposed algorithm is validated by extensive experiments based on real-world multiple cloud storage scenarios.","PeriodicalId":345268,"journal":{"name":"Comput. Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Comput. Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31577/cai_2020_1-2_51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

With the advent of big data age, data volume has been changed from trillionbyte to petabyte with incredible speed. Owing to the fact that cloud storage offers the vision of a virtually infinite pool of storage resources, data can be stored and accessed with high scalability and availability. But a single cloud-based data storage has risks like vendor lock-in, privacy leakage, and unavailability. Multi-cloud storage can mitigate these risks with geographically located cloud storage providers. In this storage scheme, one important challenge is how to place a user's data cost-effectively with high availability. In this paper, an architecture for multi-cloud storage is presented. Next, a multi-objective optimization problem is defined to minimize total cost and maximize data availability simultaneously, which can be solved by an approach based on the non-dominated sorting genetic algorithm II (NSGA-II) and obtain a set of non-dominated solutions called the Pareto-optimal set. Then, a method is proposed which is based on the entropy method to determine the most suitable solution for users who cannot choose one from the Pareto-optimal set directly. Finally, the performance of the proposed algorithm is validated by extensive experiments based on real-world multiple cloud storage scenarios.
优化数据放置的成本效益和高可用的多云存储
随着大数据时代的到来,数据量以惊人的速度从万亿字节转变为拍字节。由于云存储提供了一个几乎无限的存储资源池,因此可以以高可伸缩性和可用性存储和访问数据。但是,单一的基于云的数据存储存在供应商锁定、隐私泄露和不可用等风险。多云存储可以通过地理位置的云存储提供商减轻这些风险。在这种存储方案中,一个重要的挑战是如何以高可用性经济有效地放置用户数据。本文提出了一种多云存储体系结构。其次,定义了一个以总成本最小化和数据可用性最大化为目标的多目标优化问题,采用基于非支配排序遗传算法II (NSGA-II)的方法求解该问题,得到一组非支配解,称为pareto最优集。然后,针对用户无法直接从pareto最优集合中选择最优解的情况,提出了一种基于熵值法确定最优解的方法。最后,通过基于实际多个云存储场景的大量实验验证了所提算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信