首页> 外文期刊>Cloud Computing, IEEE Transactions on >Revenue Maximization with Optimal Capacity Control in Infrastructure as a Service Cloud Markets
【24h】

Revenue Maximization with Optimal Capacity Control in Infrastructure as a Service Cloud Markets

机译:通过基础架构即服务云市场中的最佳容量控制实现收益最大化

获取原文
获取原文并翻译 | 示例
           

摘要

Infrastructure-as-a-Service cloud providers offer diverse purchasing options and pricing plans, namely on-demand, reservation, and spot market plans. This allows them to efficiently target a variety of customer groups with distinct preferences and to generate more revenue accordingly. An important consequence of this diversification however, is that it introduces a non-trivial optimization problem related to the allocation of the provider’s available data center capacity to each pricing plan. The complexity of the problem follows from the different levels of revenue generated per unit of capacity sold, and the different commitments consumers and providers make when resources are allocated under a given plan. In this work, we address a novel problem of maximizing revenue through an optimization of capacity allocation to each pricing plan by means of admission control for reservation contracts, in a setting where aforementioned plans are jointly offered to customers. We devise both an optimal algorithm based on a stochastic dynamic programming formulation and two heuristics that trade-off optimality and computational complexity. Our evaluation, which relies on an adaptation of a large-scale real-world workload trace of Google, shows that our algorithms can significantly increase revenue compared to an allocation without capacity control given that sufficient resource contention is present in the system. In addition, we show that our heuristics effectively allow for online decision making and quantify the revenue loss caused by the assumptions made to render the optimization problem tractable.
机译:基础架构即服务的云提供商提供了多种购买选择和定价计划,即按需,预订和现货市场计划。这使他们能够有效地针对具有不同偏好的各种客户群,并相应地产生更多的收入。但是,这种多样化的一个重要结果是,它引入了一个非平凡的优化问题,该问题涉及将提供商的可用数据中心容量分配给每个定价计划。问题的复杂性来自单位销售能力产生的不同收入水平,以及在给定计划下分配资源时消费者和提供者做出的不同承诺。在这项工作中,我们解决了一个新颖的问题,即在预定计划共同提供给客户的情况下,通过预订合同的准入控制,通过优化每个定价计划的容量分配来最大化收入。我们既设计了基于随机动态规划公式的最优算法,又设计了权衡最优性和计算复杂性的两种启发式算法。我们的评估依赖于对Google的大规模实际工作量跟踪的改编,它表明,与没有容量控制的分配相比,如果系统中存在足够的资源争用,我们的算法可以显着增加收入。此外,我们证明了我们的启发式方法可以有效地进行在线决策,并量化使优化问题易于处理的假设所造成的收入损失。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号