Cloud Partner Selection Algorithm for Dynamic Cloud Collaboration

Pramod C. Mane, Abhay A. Ratnaparkhi
{"title":"Cloud Partner Selection Algorithm for Dynamic Cloud Collaboration","authors":"Pramod C. Mane, Abhay A. Ratnaparkhi","doi":"10.1109/CCEM.2014.7015486","DOIUrl":null,"url":null,"abstract":"The idea of composite cloud service has been emerging to reduce negative impact of cloud bursting. The novel idea of composite cloud services is achieved by forming a dynamic cloud collaboration platform among cloud providers. An important prerequisite of dynamic collaborative cloud formation is to reduce the cost of infrastructure and prevent loss to business enterprises owing to cloud bursting. The major concern in dynamic cloud collaboration is to minimize conflict among cloud providers and ensure each provider''s benefit. In recent years several market based models have been proposed that deal with twofold objectives: First, conflict minimization among providers and Second, benefit maximization of the providers. However, existing combinatorial auction based market models that attempt to achieve dynamic cloud collaboration are computationally in efficient. In this paper we have proposed cloud partner matching algorithm to facilitate partner selection process. Our proposed cloud partner matching algorithm minimizes conflicts among cloud providers by mutual consent.","PeriodicalId":143177,"journal":{"name":"2014 IEEE International Conference on Cloud Computing in Emerging Markets (CCEM)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Cloud Computing in Emerging Markets (CCEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCEM.2014.7015486","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The idea of composite cloud service has been emerging to reduce negative impact of cloud bursting. The novel idea of composite cloud services is achieved by forming a dynamic cloud collaboration platform among cloud providers. An important prerequisite of dynamic collaborative cloud formation is to reduce the cost of infrastructure and prevent loss to business enterprises owing to cloud bursting. The major concern in dynamic cloud collaboration is to minimize conflict among cloud providers and ensure each provider''s benefit. In recent years several market based models have been proposed that deal with twofold objectives: First, conflict minimization among providers and Second, benefit maximization of the providers. However, existing combinatorial auction based market models that attempt to achieve dynamic cloud collaboration are computationally in efficient. In this paper we have proposed cloud partner matching algorithm to facilitate partner selection process. Our proposed cloud partner matching algorithm minimizes conflicts among cloud providers by mutual consent.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
动态云协作的云合作伙伴选择算法
复合云服务的概念是为了减少云爆发的负面影响而出现的。复合云服务的新思想是通过在云提供商之间形成一个动态的云协作平台来实现的。动态协同云形成的一个重要前提是降低基础设施成本,防止云爆发给企业造成损失。动态云协作的主要关注点是最小化云提供商之间的冲突,并确保每个提供商的利益。近年来提出了一些基于市场的模型,它们处理两个目标:一是提供者之间的冲突最小化,二是提供者的利益最大化。然而,现有的基于组合拍卖的市场模型试图实现动态云协作,在计算上效率低下。在本文中,我们提出了云合作伙伴匹配算法,以方便合作伙伴的选择过程。我们提出的云合作伙伴匹配算法通过相互同意将云提供商之间的冲突最小化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Outsourcing Resource-Intensive Tasks from Mobile Apps to Clouds: Android and Aneka Integration Big Data Infrastructure for Aviation Data Analytics Cloud Based Self Driving Cars Analyzing User Behavior Using Keystroke Dynamics to Protect Cloud from Malicious Insiders A Cloud Computing Service Level Agreement Framework with Negotiation and Secure Monitoring
×
引用
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