{"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}
引用次数: 0
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.