A Novel Market Oriented Dynamic Collaborative Cloud Service Infrastructure

M. Hassan, Biao Song, Changwoo Yoon, H. Lee, E. Huh
{"title":"A Novel Market Oriented Dynamic Collaborative Cloud Service Infrastructure","authors":"M. Hassan, Biao Song, Changwoo Yoon, H. Lee, E. Huh","doi":"10.1109/SERVICES-2.2009.20","DOIUrl":null,"url":null,"abstract":"In this paper, we present a novel combinatorial auction (CA) based Cloud market model that facilitates dynamic collaboration (DC) among Cloud providers (CPs) for providing composite/collaborative Cloud services to consumers and hence can address the interoperability and scalability issues for Cloud computing. Also to minimize the conflicts that may happen when negotiating among providers in a DC platform, we propose a new auction policy in CA that allows a CP to dynamically collaborate with suitable partner CPs to form a group before joining the auction and to publish their group bids as a single bid to fulfill the service requirements completely. But to find a good combination of CP partners is a NP-hard problem. So we propose a promising multi-objective (MO) optimization model for CP partner selection that not only uses their individual information (INI) but also their past collaborative relationship information (PRI) which is seldom considered in existing approaches. A multi-objective genetic algorithm (MOGA) called MOGA-IC is also developed to solve the model. We implemented our proposed CACM model and the MOGA-IC in a simulated environment and study their economic efficiency and performance with existing model and algorithm. The experimental results show that the proposed MOGA-IC can support satisfactory and high quality partner selection in CACM model.","PeriodicalId":299945,"journal":{"name":"2009 World Conference on Services - II","volume":"192 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 World Conference on Services - II","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SERVICES-2.2009.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

In this paper, we present a novel combinatorial auction (CA) based Cloud market model that facilitates dynamic collaboration (DC) among Cloud providers (CPs) for providing composite/collaborative Cloud services to consumers and hence can address the interoperability and scalability issues for Cloud computing. Also to minimize the conflicts that may happen when negotiating among providers in a DC platform, we propose a new auction policy in CA that allows a CP to dynamically collaborate with suitable partner CPs to form a group before joining the auction and to publish their group bids as a single bid to fulfill the service requirements completely. But to find a good combination of CP partners is a NP-hard problem. So we propose a promising multi-objective (MO) optimization model for CP partner selection that not only uses their individual information (INI) but also their past collaborative relationship information (PRI) which is seldom considered in existing approaches. A multi-objective genetic algorithm (MOGA) called MOGA-IC is also developed to solve the model. We implemented our proposed CACM model and the MOGA-IC in a simulated environment and study their economic efficiency and performance with existing model and algorithm. The experimental results show that the proposed MOGA-IC can support satisfactory and high quality partner selection in CACM model.
一种新的面向市场的动态协同云服务基础设施
在本文中,我们提出了一种新颖的基于组合拍卖(CA)的云市场模型,该模型促进了云提供商(CPs)之间的动态协作(DC),以便向消费者提供组合/协作云服务,因此可以解决云计算的互操作性和可扩展性问题。此外,为了最大限度地减少数据中心平台中提供商之间谈判时可能发生的冲突,我们在CA中提出了一种新的拍卖策略,该策略允许CP与合适的合作伙伴CP动态协作,在加入拍卖之前形成一个组,并将其组投标作为单个投标发布,以完全满足服务需求。但是如何找到一个好的CP伙伴组合是一个np难题。因此,我们提出了一种有前途的多目标合作伙伴选择优化模型,该模型不仅利用了合作伙伴的个体信息(INI),而且利用了合作伙伴过去的合作关系信息(PRI),这是现有方法中很少考虑的。提出了一种多目标遗传算法(MOGA - ic)来求解该模型。我们在仿真环境中实现了所提出的ccm模型和MOGA-IC,并使用现有模型和算法研究了它们的经济效率和性能。实验结果表明,所提出的MOGA-IC能够支持ccm模型中满意的、高质量的伙伴选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信