首页> 外文期刊>Cloud Computing, IEEE Transactions on >Cost-Efficient Resource Provisioning for Dynamic Requests in Cloud Assisted Mobile Edge Computing
【24h】

Cost-Efficient Resource Provisioning for Dynamic Requests in Cloud Assisted Mobile Edge Computing

机译:云辅助移动边缘计算中的动态请求的成本高效资源配置

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

摘要

Mobile edge computing is emerging as a new computing paradigm that provides enhanced experience to mobile users via low latency connections and augmented computation capacity. As the amount of user requests is time-varying, while the computation capacity of edge hosts is limited, Cloud Assisted Mobile Edge (CAME) computing framework is introduced to improve the scalability of the edge platform. By outsourcing mobile requests to clouds with various types of instances, the CAME framework can accommodate dynamic mobile requests with diverse quality of service requirements. In order to provide guaranteed services at minimal system cost, the edge resource provisioning and cloud outsourcing of the CAME framework should be carefully designed in a cost-efficient manner. Specifically, two fundamental issues should be answered: (1) what is the optimal edge computation capacity configuration? and (2) what types of cloud instances should be tenanted and what is the amount of each type? To solve these issues, we formulate the resource provisioning in CAME framework as an optimization problem. By exploiting the piecewise convex property of this problem, the Optimal Resource Provisioning (ORP) algorithms with different instances are proposed, so as to optimize the computation capacity of edge hosts and meanwhile dynamically adjust the cloud tenancy strategy. The proposed algorithms are proved to be with polynomial computational complexity. To evaluate the performance of the ORP algorithms, extensive simulations and experiments are conducted based on both the widely-used traffic models and the Google cluster usage tracelogs, respectively. It is shown that the proposed ORP algorithms outperform the local-first and cloud-first benchmark algorithms in system flexibility and cost-efficiency.
机译:移动边缘计算是新的计算范式,通过低延迟连接和增强计算能力为移动用户提供增强的体验。随着用户请求的量是时变的,而边缘主机的计算能力是有限的,介绍了云辅助移动边缘(来自)计算框架以提高边缘平台的可扩展性。通过将移动请求外包给具有各种类型的实例的云,该框架可以满足具有各种服务质量要求的动态移动请求。为了以最少的系统成本提供保证服务,应以成本效率的方式精心设计框架的边缘资源供应和云外包。具体而言,应该回答两个基本问题:(1)什么是最佳边缘计算能力配置? (2)应该租赁哪些类型的云实例,每种类型的数量是多少?为解决这些问题,我们制定了作为优化问题的框架资源配置。通过利用此问题的分段凸性属性,提出了具有不同实例的最佳资源配置(ORP)算法,以优化边缘主机的计算能力,同时动态调整云租赁策略。证明所提出的算法具有多项式计算复杂性。为了评估ORP算法的性能,分别基于广泛使用的流量模型和Google集群使用Tracelogs进行广泛的模拟和实验。结果表明,所提出的ORP算法优于系统灵活性和成本效率的本地第一和云第一基准算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号