{"title":"分布式云基础设施约束下的成本意识虚拟机放置问题","authors":"Eya Dhib, K. Boussetta, N. Zangar, N. Tabbane","doi":"10.1109/COMNET.2017.8285591","DOIUrl":null,"url":null,"abstract":"Massively Multi-players Online Gaming (MMOG) presents one of the most popular large scale Cloud Gaming services. However, minimizing the overall MMOG operating cost is viewed as a critical task. The main challenge for MMOG providers is to find the best tradeoff between cost and response delay when allocating resources: in fact, allocating powerful resources lead to an excellent operating delay, but it is costly. However, cheapest resources don't guarantee even acceptable latency especially for high peak periods. In this view, the present paper contributes to optimize, under delay constraint, the resources allocation cost of MMOG service over a distributed Cloud infrastructure. We develop a model to capture the intrinsic trade-off between response delays relative to allocated resources and their corespondent costs. Then, we formulate the optimal VMs placement problem, which is NP-hard. Besides, we propose a Cost-aware Virtual Machines placement algorithm that approximates the best trade-off point between the two compromise terms. We evaluate our contribution comparing to a Random, Greedy Allocation Cost (GAC) and Minimum Allocation Cost (MAC) placement algorithms via Matlab tool. Results show elasticity and effectiveness of our contribution in maintaining the balance between cost and delay.","PeriodicalId":192985,"journal":{"name":"2017 Sixth International Conference on Communications and Networking (ComNet)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Cost-aware virtual machines placement problem under constraints over a distributed cloud infrastructure\",\"authors\":\"Eya Dhib, K. Boussetta, N. Zangar, N. Tabbane\",\"doi\":\"10.1109/COMNET.2017.8285591\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Massively Multi-players Online Gaming (MMOG) presents one of the most popular large scale Cloud Gaming services. However, minimizing the overall MMOG operating cost is viewed as a critical task. The main challenge for MMOG providers is to find the best tradeoff between cost and response delay when allocating resources: in fact, allocating powerful resources lead to an excellent operating delay, but it is costly. However, cheapest resources don't guarantee even acceptable latency especially for high peak periods. In this view, the present paper contributes to optimize, under delay constraint, the resources allocation cost of MMOG service over a distributed Cloud infrastructure. We develop a model to capture the intrinsic trade-off between response delays relative to allocated resources and their corespondent costs. Then, we formulate the optimal VMs placement problem, which is NP-hard. Besides, we propose a Cost-aware Virtual Machines placement algorithm that approximates the best trade-off point between the two compromise terms. We evaluate our contribution comparing to a Random, Greedy Allocation Cost (GAC) and Minimum Allocation Cost (MAC) placement algorithms via Matlab tool. Results show elasticity and effectiveness of our contribution in maintaining the balance between cost and delay.\",\"PeriodicalId\":192985,\"journal\":{\"name\":\"2017 Sixth International Conference on Communications and Networking (ComNet)\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Sixth International Conference on Communications and Networking (ComNet)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMNET.2017.8285591\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Sixth International Conference on Communications and Networking (ComNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMNET.2017.8285591","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cost-aware virtual machines placement problem under constraints over a distributed cloud infrastructure
Massively Multi-players Online Gaming (MMOG) presents one of the most popular large scale Cloud Gaming services. However, minimizing the overall MMOG operating cost is viewed as a critical task. The main challenge for MMOG providers is to find the best tradeoff between cost and response delay when allocating resources: in fact, allocating powerful resources lead to an excellent operating delay, but it is costly. However, cheapest resources don't guarantee even acceptable latency especially for high peak periods. In this view, the present paper contributes to optimize, under delay constraint, the resources allocation cost of MMOG service over a distributed Cloud infrastructure. We develop a model to capture the intrinsic trade-off between response delays relative to allocated resources and their corespondent costs. Then, we formulate the optimal VMs placement problem, which is NP-hard. Besides, we propose a Cost-aware Virtual Machines placement algorithm that approximates the best trade-off point between the two compromise terms. We evaluate our contribution comparing to a Random, Greedy Allocation Cost (GAC) and Minimum Allocation Cost (MAC) placement algorithms via Matlab tool. Results show elasticity and effectiveness of our contribution in maintaining the balance between cost and delay.