云计算系统中的虚拟机优化分配

Wenlong Ni, Jue Wang, Ziyang Liu, Huaixiang Song, Huangning Chen, Xinyu Zhou
{"title":"云计算系统中的虚拟机优化分配","authors":"Wenlong Ni, Jue Wang, Ziyang Liu, Huaixiang Song, Huangning Chen, Xinyu Zhou","doi":"10.1109/icsai53574.2021.9664088","DOIUrl":null,"url":null,"abstract":"Cloud Computing (CC) is a popular computing paradigm by providing virtual resources as services over the internet. In the CC system, each user request can get services on a pay as you use basis. There is reward and system cost for serving each request, and the service provider can decide the amount of resources to assign to each request. Regardless of the random request arrivals and departures, a novel model of the Continous-Time Markov Decision Process (CTMDP) is explored. In this paper our goal is to maximize the total discounted expected reward for service providers. With the solution of the Bellman optimality equation by the value iteration method, an optimal policy can be achieved.","PeriodicalId":131284,"journal":{"name":"2021 7th International Conference on Systems and Informatics (ICSAI)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal Virtual Machine Allocations in Cloud Computing System\",\"authors\":\"Wenlong Ni, Jue Wang, Ziyang Liu, Huaixiang Song, Huangning Chen, Xinyu Zhou\",\"doi\":\"10.1109/icsai53574.2021.9664088\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud Computing (CC) is a popular computing paradigm by providing virtual resources as services over the internet. In the CC system, each user request can get services on a pay as you use basis. There is reward and system cost for serving each request, and the service provider can decide the amount of resources to assign to each request. Regardless of the random request arrivals and departures, a novel model of the Continous-Time Markov Decision Process (CTMDP) is explored. In this paper our goal is to maximize the total discounted expected reward for service providers. With the solution of the Bellman optimality equation by the value iteration method, an optimal policy can be achieved.\",\"PeriodicalId\":131284,\"journal\":{\"name\":\"2021 7th International Conference on Systems and Informatics (ICSAI)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 7th International Conference on Systems and Informatics (ICSAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/icsai53574.2021.9664088\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 7th International Conference on Systems and Informatics (ICSAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icsai53574.2021.9664088","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

云计算(CC)是一种流行的计算范式,它通过互联网提供虚拟资源作为服务。在CC系统中,每个用户请求都可以在按需付费的基础上获得服务。服务每个请求都有奖励和系统成本,服务提供者可以决定分配给每个请求的资源量。在不考虑随机请求到达和离开的情况下,提出了一种新的连续时间马尔可夫决策过程模型。在本文中,我们的目标是最大化服务提供者的总折扣预期奖励。利用数值迭代法求解Bellman最优性方程,得到最优策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal Virtual Machine Allocations in Cloud Computing System
Cloud Computing (CC) is a popular computing paradigm by providing virtual resources as services over the internet. In the CC system, each user request can get services on a pay as you use basis. There is reward and system cost for serving each request, and the service provider can decide the amount of resources to assign to each request. Regardless of the random request arrivals and departures, a novel model of the Continous-Time Markov Decision Process (CTMDP) is explored. In this paper our goal is to maximize the total discounted expected reward for service providers. With the solution of the Bellman optimality equation by the value iteration method, an optimal policy can be achieved.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信