云中基于QoS的资源分配和服务选择

Rima Grati, Khouloud Boukadi, H. Ben-Abdallah
{"title":"云中基于QoS的资源分配和服务选择","authors":"Rima Grati, Khouloud Boukadi, H. Ben-Abdallah","doi":"10.5220/0005059602490256","DOIUrl":null,"url":null,"abstract":"Web service composition builds a new value-added web service using existing Web services. A Web service may have many implementations, all of which have the same functionality, but may have different Quality of Service (QoS) values. Hence, a challenging issue of Web service composition is how to meet QoS and to fulfil cloud customers' expectations and preferences in the inherently dynamic environment of the Cloud. Addressing the QoS based web service selection and resource allocation is the focus of this paper. This challenge is a multi-objective optimization problem. To tackle this complex problem, we propose a new Penalty Genetic Algorithm (PGA) to help a Cloud provider quickly determine a set of services that compose the workflow of the composite Web service. The proposed approach aims to, at the one hand, meet QoS constraints prioritized by the Cloud customer and, at the other hand, respect the resource constraints of the Cloud provider. To the best of our knowledge, this is the first attempt to handle the problem of the optimal selection of Web services while taking into account the resource allocation in order to guarantee the QoS imposed by the Cloud customer and to maximize the profit of the Cloud provider. The experimental results of Penalty Genetic Algorithm show that it outperforms the Integer Programming method when the number of Web services and the number of resources are large.","PeriodicalId":114336,"journal":{"name":"2014 11th International Conference on e-Business (ICE-B)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"QoS based resource allocation and service selection in the Cloud\",\"authors\":\"Rima Grati, Khouloud Boukadi, H. Ben-Abdallah\",\"doi\":\"10.5220/0005059602490256\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Web service composition builds a new value-added web service using existing Web services. A Web service may have many implementations, all of which have the same functionality, but may have different Quality of Service (QoS) values. Hence, a challenging issue of Web service composition is how to meet QoS and to fulfil cloud customers' expectations and preferences in the inherently dynamic environment of the Cloud. Addressing the QoS based web service selection and resource allocation is the focus of this paper. This challenge is a multi-objective optimization problem. To tackle this complex problem, we propose a new Penalty Genetic Algorithm (PGA) to help a Cloud provider quickly determine a set of services that compose the workflow of the composite Web service. The proposed approach aims to, at the one hand, meet QoS constraints prioritized by the Cloud customer and, at the other hand, respect the resource constraints of the Cloud provider. To the best of our knowledge, this is the first attempt to handle the problem of the optimal selection of Web services while taking into account the resource allocation in order to guarantee the QoS imposed by the Cloud customer and to maximize the profit of the Cloud provider. The experimental results of Penalty Genetic Algorithm show that it outperforms the Integer Programming method when the number of Web services and the number of resources are large.\",\"PeriodicalId\":114336,\"journal\":{\"name\":\"2014 11th International Conference on e-Business (ICE-B)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 11th International Conference on e-Business (ICE-B)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5220/0005059602490256\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 11th International Conference on e-Business (ICE-B)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0005059602490256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

Web服务组合使用现有Web服务构建新的增值Web服务。Web服务可能有许多实现,它们都具有相同的功能,但可能具有不同的服务质量(QoS)值。因此,Web服务组合的一个具有挑战性的问题是如何在云的固有动态环境中满足QoS并满足云客户的期望和偏好。解决基于QoS的web服务选择和资源分配问题是本文研究的重点。这是一个多目标优化问题。为了解决这个复杂的问题,我们提出了一种新的惩罚遗传算法(PGA)来帮助云提供商快速确定组成复合Web服务工作流的一组服务。提出的方法旨在一方面满足云客户优先考虑的QoS约束,另一方面尊重云提供商的资源约束。据我们所知,这是第一次尝试在考虑资源分配的情况下处理Web服务的最优选择问题,以保证云客户所施加的QoS,并使云提供商的利润最大化。实验结果表明,在Web服务数量和资源数量较大的情况下,惩罚遗传算法优于整数规划方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
QoS based resource allocation and service selection in the Cloud
Web service composition builds a new value-added web service using existing Web services. A Web service may have many implementations, all of which have the same functionality, but may have different Quality of Service (QoS) values. Hence, a challenging issue of Web service composition is how to meet QoS and to fulfil cloud customers' expectations and preferences in the inherently dynamic environment of the Cloud. Addressing the QoS based web service selection and resource allocation is the focus of this paper. This challenge is a multi-objective optimization problem. To tackle this complex problem, we propose a new Penalty Genetic Algorithm (PGA) to help a Cloud provider quickly determine a set of services that compose the workflow of the composite Web service. The proposed approach aims to, at the one hand, meet QoS constraints prioritized by the Cloud customer and, at the other hand, respect the resource constraints of the Cloud provider. To the best of our knowledge, this is the first attempt to handle the problem of the optimal selection of Web services while taking into account the resource allocation in order to guarantee the QoS imposed by the Cloud customer and to maximize the profit of the Cloud provider. The experimental results of Penalty Genetic Algorithm show that it outperforms the Integer Programming method when the number of Web services and the number of resources are large.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信