Exploring Evolutive Methods for Cloud Provider Selection Based on Performance Indicators

Lucas Borges de Moraes, Adriano Fiorese, R. S. Parpinelli
{"title":"Exploring Evolutive Methods for Cloud Provider Selection Based on Performance Indicators","authors":"Lucas Borges de Moraes, Adriano Fiorese, R. S. Parpinelli","doi":"10.1109/BRACIS.2018.00035","DOIUrl":null,"url":null,"abstract":"The cloud computing model has been spreading around the world and has become a basis for innovation and efficiency on provisioning computational services. This fact inspired the emergence of a large number of new companies providing cloud computing services. In order to qualify such providers, performance indicators (PI) are useful for systematic information collection. Select which providers are the most suitable to each customer's needs and with the desired quality of service, has become a hard problem with the need of robust search methods. Thus, the problem is to find the smallest set of providers that maximize the attendance of a customer's request with and the lowest price. In this paper, two evolutionary algorithms, named Genetic Algorithms (GA) and Binary Differential Evolution (BDE), are modeled to address this problem. Instances with 10, 100, and 200 providers are employed. Results obtained are compared with a deterministic method and show that the BDE approach outperforms GA and the deterministic method.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRACIS.2018.00035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The cloud computing model has been spreading around the world and has become a basis for innovation and efficiency on provisioning computational services. This fact inspired the emergence of a large number of new companies providing cloud computing services. In order to qualify such providers, performance indicators (PI) are useful for systematic information collection. Select which providers are the most suitable to each customer's needs and with the desired quality of service, has become a hard problem with the need of robust search methods. Thus, the problem is to find the smallest set of providers that maximize the attendance of a customer's request with and the lowest price. In this paper, two evolutionary algorithms, named Genetic Algorithms (GA) and Binary Differential Evolution (BDE), are modeled to address this problem. Instances with 10, 100, and 200 providers are employed. Results obtained are compared with a deterministic method and show that the BDE approach outperforms GA and the deterministic method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于绩效指标的云提供商选择的进化方法探索
云计算模型已经在世界范围内传播,并已成为提供计算服务的创新和效率的基础。这一事实激发了大量提供云计算服务的新公司的出现。为了使这些提供者合格,性能指标(PI)对于系统的信息收集是有用的。选择最适合每个客户需求并具有理想服务质量的供应商,已经成为一个需要鲁棒搜索方法的难题。因此,问题是找到能够以最低价格最大化客户请求的出席率的最小提供商集。本文采用遗传算法(GA)和二元差分进化(BDE)两种进化算法来解决这一问题。使用具有10个、100个和200个提供者的实例。将所得结果与确定性方法进行了比较,结果表明BDE方法优于遗传算法和确定性方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Exploring the Data Using Extended Association Rule Network SPt: A Text Mining Process to Extract Relevant Areas from SW Documents to Exploratory Tests Gene Essentiality Prediction Using Topological Features From Metabolic Networks Bio-Inspired and Heuristic Methods Applied to a Benchmark of the Task Scheduling Problem A New Genetic Algorithm-Based Pruning Approach for Optimum-Path Forest
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1