A Game Theoretic Framework of SLA-based Resource Allocation for Competitive Cloud Service Providers

Yanzhi Wang, Xue Lin, Massoud Pedram
{"title":"A Game Theoretic Framework of SLA-based Resource Allocation for Competitive Cloud Service Providers","authors":"Yanzhi Wang, Xue Lin, Massoud Pedram","doi":"10.1109/GREENTECH.2014.22","DOIUrl":null,"url":null,"abstract":"Cloud computing is an emerging paradigm that allows the on-demand delivering of software, hardware, and data as services. It has attracted a lot of attention recently due to the increasing demand for high performance computing and storage. Resource allocation is one of the most important challenges in the cloud computing system, especially when the clients have some Service Level Agreements (SLAs) and the total profit depends on how the system can meet these SLAs. A set of multiple cloud service providers (CSPs) in the cloud, such as Google or Amazon, may support the similar type of application, and therefore, service requests generated from the network edges are free to be dispatched to any CSP in the set. This paper considers the problem of SLA-based resource provisioning and management among different CSPs. Each CSP owns a set of potentially heterogeneous servers supporting a common application type, and each performs resource allocation in these servers for request processing. In the cloud, a central request dispatcher allocates service requests to different servers (belonging to potentially different CSPs) based on the amounts of allocated resources in those servers. Each CSP optimizes its own profit, which is the total revenue obtained from servicing the clients subtracted by the total energy cost. The total revenue depends on the average service request response time as specified in the SLAs. The resource allocation problem among multiple CSPs forms a competitive normal-form game, since the payoff (profit) of each CSP depends not only on its own resource allocation results but also on the actions of the other CSPs. The existence and uniqueness of Nash equilibrium in this game are proved. Each CSP will find its optimal strategy at the Nash equilibrium point using the convex optimization technique. Experimental results demonstrate the effectiveness of the game theoretic resource provisioning framework for the CSPs.","PeriodicalId":194092,"journal":{"name":"2014 Sixth Annual IEEE Green Technologies Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Sixth Annual IEEE Green Technologies Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GREENTECH.2014.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

Abstract

Cloud computing is an emerging paradigm that allows the on-demand delivering of software, hardware, and data as services. It has attracted a lot of attention recently due to the increasing demand for high performance computing and storage. Resource allocation is one of the most important challenges in the cloud computing system, especially when the clients have some Service Level Agreements (SLAs) and the total profit depends on how the system can meet these SLAs. A set of multiple cloud service providers (CSPs) in the cloud, such as Google or Amazon, may support the similar type of application, and therefore, service requests generated from the network edges are free to be dispatched to any CSP in the set. This paper considers the problem of SLA-based resource provisioning and management among different CSPs. Each CSP owns a set of potentially heterogeneous servers supporting a common application type, and each performs resource allocation in these servers for request processing. In the cloud, a central request dispatcher allocates service requests to different servers (belonging to potentially different CSPs) based on the amounts of allocated resources in those servers. Each CSP optimizes its own profit, which is the total revenue obtained from servicing the clients subtracted by the total energy cost. The total revenue depends on the average service request response time as specified in the SLAs. The resource allocation problem among multiple CSPs forms a competitive normal-form game, since the payoff (profit) of each CSP depends not only on its own resource allocation results but also on the actions of the other CSPs. The existence and uniqueness of Nash equilibrium in this game are proved. Each CSP will find its optimal strategy at the Nash equilibrium point using the convex optimization technique. Experimental results demonstrate the effectiveness of the game theoretic resource provisioning framework for the CSPs.
基于sla的竞争云服务提供商资源分配博弈框架
云计算是一种新兴的范例,它允许按需交付软件、硬件和数据作为服务。由于对高性能计算和存储的需求不断增加,它最近引起了很多关注。资源分配是云计算系统中最重要的挑战之一,特别是当客户端有一些服务水平协议(Service Level Agreements, sla)并且总利润取决于系统如何满足这些sla时。云中的一组多个云服务提供商(CSP),如Google或Amazon,可能支持类似类型的应用程序,因此,从网络边缘生成的服务请求可以免费分配给该集合中的任何CSP。本文研究了基于sla的云服务提供商之间的资源配置和管理问题。每个CSP都拥有一组支持通用应用程序类型的潜在异构服务器,每个CSP都在这些服务器中执行资源分配以进行请求处理。在云中,中央请求调度程序根据服务器中分配的资源量将服务请求分配给不同的服务器(可能属于不同的csp)。每个CSP优化自己的利润,这是服务客户获得的总收入减去总能源成本。总收入取决于sla中指定的平均服务请求响应时间。多个CSP之间的资源分配问题形成了一个竞争的规范化博弈,因为每个CSP的收益(利润)不仅取决于自己的资源分配结果,还取决于其他CSP的行动。证明了该对策的纳什均衡的存在唯一性。每个CSP将使用凸优化技术在纳什平衡点找到其最优策略。实验结果证明了该博弈论资源配置框架对csp的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信