【24h】

Dynamic Clone Sharing Scheme in Mobile Cloud Computing: A Delaunay Triangulation Approach

机译:移动云计算中的动态克隆共享方案:Delaunay三角剖分方法

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

摘要

Owing to the nature of elastic resource pooling, cloud computing offers a great opportunity to extend the potentials of Mobile Devices (MDs) for supporting the resources-hungry applications. In the mobile cloud platforms, each MD is associated with a system-level clone in the cloud infrastructure. It provides the potentials in supporting the clone sharing. The clone sharing can reduce the communication delay between an MD and its clone when the MD moves far away from its clone. It is because that clone sharing can migrate the service from the remote source clone to a nearby target clone. Considering the mobility of MDs, how to select the appropriate target clone is still a big challenge. In this paper, we first pose the clone sharing question. The clone sharing can reduce the service delay between a MD and its clone when the MD move far away from its clone. It is because that it migrate the service from the remote source clone to a local target clone. However, how to select the appropriate target clone is a big challenge. We propose a clone sharing scheme, called as Triangulation-based Clone Sharing Scheme (TCS), to solve the problem. In the TCS scheme, we firstly disclose the relationship between clone serving area and the MD. Secondly, the TCS scheme splits the clone network into Triangle topology by our Clone Triangulation Topology Construction and Reconstruction (CTTCR) algorithm. It can accurately obtain the target clone for clone migration. We also prove the correctness of CTTCR algorithm. Simulation results show that our scheme works very well.
机译:由于弹性资源池的性质,云计算为扩展移动设备(MD)的潜力提供了一个绝佳的机会,以支持需要大量资源的应用程序。在移动云平台中,每个MD都与云基础架构中的系统级克隆关联。它提供了支持克隆共享的潜力。当MD远离其克隆时,克隆共享可以减少MD及其克隆之间的通信延迟。这是因为克隆共享可以将服务从远程源克隆迁移到附近的目标克隆。考虑到MD的移动性,如何选择合适的靶标克隆仍然是一个很大的挑战。在本文中,我们首先提出克隆共享问题。当MD远离其克隆时,克隆共享可以减少MD及其克隆之间的服务延迟。这是因为它将服务从远程源克隆迁移到本地目标克隆。但是,如何选择合适的靶标克隆是一个很大的挑战。我们提出了一种克隆共享方案,称为基于三角剖分的克隆共享方案(TCS),以解决该问题。在TCS方案中,我们首先公开了克隆服务区与MD之间的关系。其次,TCS方案通过我们的克隆三角剖分拓扑构造和重建(CTTCR)算法将克隆网络划分为三角形拓扑。它可以准确地获取用于克隆迁移的目标克隆。我们还证明了CTTCR算法的正确性。仿真结果表明我们的方案效果很好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号