Online Virtual Machine Placement for Increasing Cloud Provider’s Revenue

Online Virtual Machine Placement for Increasing Cloud Provider’s Revenue
复制标题

在线虚拟机放置可增加云提供商的收入

DOI:
10.1109/tsc.2015.2447550
复制
发表时间:
2017-03
影响因子:
8.1
通讯作者:
Ce Yu
Ce Yu
中科院分区:
计算机科学2区
文献类型:
--
作者:
Laiping Zhao;Liangfu Lv;Zhou Jin;Ce Yu

文献摘要

参考文献

被引文献

相似文献

节省成本已成为数据中心管理的重大挑战。在本文中,我们表明,除了能源消耗之外,违反服务级别协议(SLA)也会严重降低数据中心的成本效率。我们提出在线虚拟机放置算法,以增加云提供商的收入。首先,First-Fit 和 Harmonic 算法是为虚拟机放置而设计的,无需考虑迁移。两种算法在最坏情况分析中获得相同的性能,并且等于竞争比的下限。然而,当作业到达率大于1.0时,Harmonic算法可以比First-Fit创造更多10%以上的收入。其次,我们制定了一个最大化虚拟机迁移收入的优化问题,并通过减少 3 分区问题来证明它是 NP-Hard。因此,我们提出两种启发式:最不可靠优先(LRF)和减少密度贪婪(DDG)。实验表明,当迁移成本较低时,DDG 比 LRF 产生更多收入,但在 SLA 惩罚较低或作业到达率较高时,由于迁移数量较多,会导致损失。最后,我们使用真实轨迹将上述四种算法与Openstack中采用的算法进行比较,发现结果与使用合成数据的结果一致。
Cost savings have become a significant challenge in the management of data centers. In this paper, we show that, besides energy consumption, service level agreement (SLA) violations also severely degrade the cost-efficiency of data centers. We present online VM placement algorithms for increasing cloud provider’s revenue. First, First-Fit and Harmonic algorithm are devised for VM placement without considering migrations. Both algorithms get the same performance in the worst-case analysis, and equal to the lower bound of the competitive ratio. However, Harmonic algorithm could create more revenue than First-Fit by more than 10 percent when job arriving rate is greater than 1.0. Second, we formulate an optimization problem of maximizing revenue from VM migration, and prove it as NP-Hard by a reduction from 3-Partition problem. Therefore, we propose two heuristics: Least-Reliable-First (LRF) and Decreased-Density-Greedy (DDG). Experiments demonstrate that DDG yields more revenue than LRF when migration cost is low, yet leads to losses when SLA penalty is low or job arriving rate is high, due to the large number of migrations. Finally, we compare the four algorithms above with algorithms adopted in Openstack using a real trace, and find that the results are consistent with the ones using synthetic data.
DOI: 10.1002/cpe.1370
发表时间: 2010
期刊: Concurrency and Computation: Practice and Experience
影响因子: --
作者:
Mario Macías;Omer F. Rana;Garry Smith;Jordi Guitart;Jordi Torres
通讯作者: Mario Macías;Omer F. Rana;Garry Smith;Jordi Guitart;Jordi Torres
DOI: 10.1109/ucc.2011.28
发表时间: 2011-12
期刊: 2011 Fourth IEEE International Conference on Utility and Cloud Computing
影响因子: --
作者:
Weiming Shi;Bo Hong
通讯作者: Weiming Shi;Bo Hong
DOI: 10.1145/1891719.1891721
发表时间: 2010-11
期刊: --
影响因子: --
作者:
Akshat Verma;Gautam Kumar;Ricardo Koller
通讯作者: Akshat Verma;Gautam Kumar;Ricardo Koller
DOI: 10.1109/cloud.2012.57
发表时间: 2012-06
期刊: 2012 IEEE Fifth International Conference on Cloud Computing
影响因子: --
作者:
S. Kikuchi;Y. Matsumoto
通讯作者: S. Kikuchi;Y. Matsumoto
DOI: 10.1109/infcom.2010.5461930
发表时间: 2010-03
期刊: 2010 Proceedings IEEE INFOCOM
影响因子: --
作者:
Xiaoqiao Meng;V. Pappas;Li Zhang
通讯作者: Xiaoqiao Meng;V. Pappas;Li Zhang