混合蝙蝠和遗传算法在云环境下成本有效的软件即服务放置方法

Jemal Nuradis, Frezewud Lemma
{"title":"混合蝙蝠和遗传算法在云环境下成本有效的软件即服务放置方法","authors":"Jemal Nuradis, Frezewud Lemma","doi":"10.1109/I-SMAC47947.2019.9032665","DOIUrl":null,"url":null,"abstract":"The increasing demand of software service in cloud environment needs strategic placement in the cloud infrastructure. Thus, in which the users use the service based on the service model of the provider and pays based on their use of the resources. These resources are storage, memory processing element and bandwidth. Efficient optimal placement is the main issue in order to provide a cost effective service to the user. This research has proposed hybrid approaches to addresses the initial software task placement problem by exploring the advantage of both Bat algorithm (BA) and Genetic algorithm (GA), to make the initial ST placement processes optimum and cost effective. In order to evaluate the performance of the proposed hybrid algorithms, an experimental environment had configured using CloudSim simulation tool. The proposed solution performance has evaluated by compared with those existing placement algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization algorithm (PSO). According to the result the proposed algorithm has reduced the placement cost up to 2 −13% on a cloud environment.","PeriodicalId":275791,"journal":{"name":"2019 Third International conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Hybrid Bat and Genetic Algorthim Approach for Cost Effective SaaS Placement in Cloud Environment\",\"authors\":\"Jemal Nuradis, Frezewud Lemma\",\"doi\":\"10.1109/I-SMAC47947.2019.9032665\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The increasing demand of software service in cloud environment needs strategic placement in the cloud infrastructure. Thus, in which the users use the service based on the service model of the provider and pays based on their use of the resources. These resources are storage, memory processing element and bandwidth. Efficient optimal placement is the main issue in order to provide a cost effective service to the user. This research has proposed hybrid approaches to addresses the initial software task placement problem by exploring the advantage of both Bat algorithm (BA) and Genetic algorithm (GA), to make the initial ST placement processes optimum and cost effective. In order to evaluate the performance of the proposed hybrid algorithms, an experimental environment had configured using CloudSim simulation tool. The proposed solution performance has evaluated by compared with those existing placement algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization algorithm (PSO). According to the result the proposed algorithm has reduced the placement cost up to 2 −13% on a cloud environment.\",\"PeriodicalId\":275791,\"journal\":{\"name\":\"2019 Third International conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Third International conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/I-SMAC47947.2019.9032665\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Third International conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I-SMAC47947.2019.9032665","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

随着云环境下软件服务需求的不断增长,需要在云基础设施中进行战略性布局。因此,在这种情况下,用户根据提供者的服务模型使用服务,并根据他们对资源的使用情况付费。这些资源是存储器、存储器处理元件和带宽。为了向用户提供具有成本效益的服务,有效的最佳放置是主要问题。本研究通过探索Bat算法(BA)和遗传算法(GA)的优势,提出了解决初始软件任务放置问题的混合方法,以使初始ST放置过程最优且具有成本效益。为了评估所提出的混合算法的性能,使用CloudSim仿真工具配置了实验环境。通过与遗传算法(GA)和粒子群优化算法(PSO)等现有的求解算法进行比较,评价了该算法的求解性能。结果表明,该算法在云环境下的放置成本降低了2 - 13%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hybrid Bat and Genetic Algorthim Approach for Cost Effective SaaS Placement in Cloud Environment
The increasing demand of software service in cloud environment needs strategic placement in the cloud infrastructure. Thus, in which the users use the service based on the service model of the provider and pays based on their use of the resources. These resources are storage, memory processing element and bandwidth. Efficient optimal placement is the main issue in order to provide a cost effective service to the user. This research has proposed hybrid approaches to addresses the initial software task placement problem by exploring the advantage of both Bat algorithm (BA) and Genetic algorithm (GA), to make the initial ST placement processes optimum and cost effective. In order to evaluate the performance of the proposed hybrid algorithms, an experimental environment had configured using CloudSim simulation tool. The proposed solution performance has evaluated by compared with those existing placement algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization algorithm (PSO). According to the result the proposed algorithm has reduced the placement cost up to 2 −13% on a cloud environment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信