分布式云基础设施约束下的成本意识虚拟机放置问题

Eya Dhib, K. Boussetta, N. Zangar, N. Tabbane
{"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}
引用次数: 7

摘要

大规模多人在线游戏(MMOG)是目前最流行的大规模云游戏服务之一。然而,最小化MMOG的总体运营成本被视为一项关键任务。MMOG提供者面临的主要挑战是在分配资源时找到成本和响应延迟之间的最佳权衡:事实上,分配强大的资源会导致良好的操作延迟,但代价很高。然而,最便宜的资源甚至不能保证可接受的延迟,尤其是在高峰时段。从这个角度来看,本文有助于在延迟约束下优化分布式云基础设施上MMOG服务的资源分配成本。我们开发了一个模型来捕捉与分配资源相关的响应延迟与其相应成本之间的内在权衡。然后,我们提出了np困难的最优vm放置问题。此外,我们提出了一种成本感知的虚拟机放置算法,该算法近似于两个折衷条款之间的最佳折衷点。我们通过Matlab工具与随机,贪婪分配成本(GAC)和最小分配成本(MAC)放置算法进行比较,评估我们的贡献。结果表明,我们在维持成本和延迟之间的平衡方面所做的贡献具有弹性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信