首页> 外文期刊>Enterprise information systems >Cost-aware request routing in multi-geography cloud data centres using software-defined networking
【24h】

Cost-aware request routing in multi-geography cloud data centres using software-defined networking

机译:使用软件定义的网络在多地理位置云数据中心中了解成本的请求路由

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

摘要

Current geographically distributed cloud data centres (CDCs) require gigantic energy and bandwidth costs to provide multiple cloud applications to users around the world. Previous studies only focus on energy cost minimisation in distributed CDCs. However, a CDC provider needs to deliver gigantic data between users and distributed CDCs through internet service providers (ISPs). Geographical diversity of bandwidth and energy costs brings a highly challenging problem of how to minimise the total cost of a CDC provider. With the recently emerging software-defined networking, we study the total cost minimisation problem for a CDC provider by exploiting geographical diversity of energy and bandwidth costs. We formulate the total cost minimisation problem as a mixed integer non-linear programming (MINLP). Then, we develop heuristic algorithms to solve the problem and to provide a cost-aware request routing for joint optimisation of the selection of ISPs and the number of servers in distributed CDCs. Besides, to tackle the dynamic workload in distributed CDCs, this article proposes a regression-based workload prediction method to obtain future incoming workload. Finally, this work evaluates the cost-aware request routing by trace-driven simulation and compares it with the existing approaches to demonstrate its effectiveness.
机译:当前在地理上分散的云数据中心(CDC)需要巨大的能源和带宽成本,才能为世界各地的用户提供多个云应用程序。以前的研究仅关注分布式CDC中的能源成本最小化。但是,CDC提供商需要通过互联网服务提供商(ISP)在用户和分布式CDC之间传递巨大的数据。带宽和能源成本的地域多样性带来了一个极具挑战性的问题,即如何最大程度地降低CDC提供商的总成本。通过最近出现的软件定义网络,我们通过利用能源和带宽成本的地域多样性研究了CDC提供商的总成本最小化问题。我们将总成本最小化问题公式化为混合整数非线性规划(MINLP)。然后,我们开发启发式算法来解决该问题,并提供一种可感知成本的请求路由,以共同优化ISP的选择和分布式CDC中的服务器数量。此外,为了解决分布式CDC中的动态工作量,本文提出了一种基于回归的工作量预测方法来获取将来的传入工作量。最后,这项工作通过跟踪驱动的仿真评估了可感知成本的请求路由,并将其与现有方法进行比较以证明其有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号