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

Zhen Yang, Xing Liu
{"title":"Dynamic Clone Sharing Scheme in Mobile Cloud Computing: A Delaunay Triangulation Approach","authors":"Zhen Yang, Xing Liu","doi":"10.1109/CSE.2014.252","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 17th International Conference on Computational Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSE.2014.252","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

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.
移动云计算中的动态克隆共享方案:一种Delaunay三角测量方法
由于弹性资源池的性质,云计算提供了一个很好的机会来扩展移动设备(MDs)的潜力,以支持资源匮乏的应用程序。在移动云平台中,每个MD都与云基础架构中的系统级克隆相关联。它提供了支持克隆共享的潜力。克隆共享可以减少MD远离其克隆时与其克隆之间的通信延迟。因为克隆共享可以将远端源克隆的业务迁移到近端的目标克隆。考虑到MDs的移动性,如何选择合适的目标克隆仍然是一个很大的挑战。在本文中,我们首先提出克隆共享问题。克隆共享可以减少MD远离其克隆时与其克隆之间的服务延迟。这是因为它将服务从远端源克隆迁移到本地目标克隆。然而,如何选择合适的目标克隆是一个很大的挑战。为了解决这一问题,我们提出了一种基于三角测量的克隆共享方案(TCS)。在TCS方案中,我们首先揭示了克隆服务区域与MD之间的关系。其次,TCS方案通过克隆三角剖分拓扑构建与重构(CTTCR)算法将克隆网络划分为三角形拓扑。能够准确获取克隆迁移的目标克隆。证明了CTTCR算法的正确性。仿真结果表明了该方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信