Cost-aware cloud storage service allocation for distributed data gathering

Catalin Negru, Florin Pop, M. Mocanu, V. Cristea, A. Hangan, L. Văcariu
{"title":"Cost-aware cloud storage service allocation for distributed data gathering","authors":"Catalin Negru, Florin Pop, M. Mocanu, V. Cristea, A. Hangan, L. Văcariu","doi":"10.1109/AQTR.2016.7501280","DOIUrl":null,"url":null,"abstract":"In today cyber-infrastructures, large datasets are produced in real-time by different sources geographically distributed. These data must be acquired and preserved for further use in knowledge extraction. In the context of multi-cloud environments, the cost-efficient storage service selection is a challenge. There are plenty of Cloud storage providers offering multiple options so, it is crucial to select the best solution in terms of cost and quality of service that meet customers requirements. Due to its multi-objective nature, the process of optimal service selection becomes a difficult problem. In this paper, we study the multi-objective optimization problem for storage service selection. We start from a real world case scenario and build our mathematical model for the optimization problem. Then we propose an aggregated linear programming technique to find a near optimal solution for the service selection problem.","PeriodicalId":110627,"journal":{"name":"2016 IEEE International Conference on Automation, Quality and Testing, Robotics (AQTR)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Automation, Quality and Testing, Robotics (AQTR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AQTR.2016.7501280","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In today cyber-infrastructures, large datasets are produced in real-time by different sources geographically distributed. These data must be acquired and preserved for further use in knowledge extraction. In the context of multi-cloud environments, the cost-efficient storage service selection is a challenge. There are plenty of Cloud storage providers offering multiple options so, it is crucial to select the best solution in terms of cost and quality of service that meet customers requirements. Due to its multi-objective nature, the process of optimal service selection becomes a difficult problem. In this paper, we study the multi-objective optimization problem for storage service selection. We start from a real world case scenario and build our mathematical model for the optimization problem. Then we propose an aggregated linear programming technique to find a near optimal solution for the service selection problem.
分布式数据采集的成本意识云存储服务分配
在当今的网络基础设施中,大型数据集是由地理分布的不同来源实时产生的。必须获取和保存这些数据,以便在知识提取中进一步使用。在多云环境下,选择经济高效的存储服务是一个挑战。有很多云存储提供商提供多种选择,因此,在成本和服务质量方面选择满足客户需求的最佳解决方案至关重要。由于其多目标特性,最优服务选择过程成为一个难题。本文研究了存储服务选择的多目标优化问题。我们从现实世界的案例场景出发,为优化问题建立数学模型。然后,我们提出了一种聚合线性规划技术来寻找服务选择问题的近最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信