A Load and Distance Aware Cloudlet Selection Strategy in Multi-Cloudlet Environment

IF 0.6 Q4 COMPUTER SCIENCE, THEORY & METHODS
Ramasubbareddy Somula, Eduardo Oliveros, T. Cucinotta, S. Phillips, Xiaoyu Yang, Jia Chen, Cui-xia Ma, Hongan Wang, Hai-yan Yang
{"title":"A Load and Distance Aware Cloudlet Selection Strategy in Multi-Cloudlet Environment","authors":"Ramasubbareddy Somula, Eduardo Oliveros, T. Cucinotta, S. Phillips, Xiaoyu Yang, Jia Chen, Cui-xia Ma, Hongan Wang, Hai-yan Yang","doi":"10.4018/IJGHPC.2019040105","DOIUrl":null,"url":null,"abstract":"Day to day the usage of mobile devices (MD) is growing in people's lives. But still the MD is limited in terms of memory, battery life time, processing capacity. In order to overcome these issues, the new emerging technology named mobile cloud computing (MCC) has been introduced. The offloading mechanism execute the resource intensive application on the remote cloud to save both the battery utilization and execution time. But still the high latency challenges in MCC need to be addressed by executing resource intensive task at nearby resource cloud server. The key challenge is to find optimal cloudlet to execute task to save computation time. In this article, the authors propose a Round Robin algorithm based on cloudlet selection in heterogeneous MCC system. This article considers both load and distance of server to find optimal cloudlet and minimize waiting time of the user request at server queue. Additionally, the authors provide mathematical evaluation of the algorithm and compare with existing load balancing algorithms.","PeriodicalId":43565,"journal":{"name":"International Journal of Grid and High Performance Computing","volume":"18 1","pages":"85-102"},"PeriodicalIF":0.6000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Grid and High Performance Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/IJGHPC.2019040105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 13

Abstract

Day to day the usage of mobile devices (MD) is growing in people's lives. But still the MD is limited in terms of memory, battery life time, processing capacity. In order to overcome these issues, the new emerging technology named mobile cloud computing (MCC) has been introduced. The offloading mechanism execute the resource intensive application on the remote cloud to save both the battery utilization and execution time. But still the high latency challenges in MCC need to be addressed by executing resource intensive task at nearby resource cloud server. The key challenge is to find optimal cloudlet to execute task to save computation time. In this article, the authors propose a Round Robin algorithm based on cloudlet selection in heterogeneous MCC system. This article considers both load and distance of server to find optimal cloudlet and minimize waiting time of the user request at server queue. Additionally, the authors provide mathematical evaluation of the algorithm and compare with existing load balancing algorithms.
多云环境中负载和距离感知的云选择策略
移动设备(MD)的使用在人们的生活中日益增长。但是,在内存、电池寿命、处理能力等方面,MD仍然是有限的。为了克服这些问题,新兴的移动云计算(MCC)技术应运而生。卸载机制在远程云中执行资源密集型应用程序,以节省电池利用率和执行时间。但是,MCC中的高延迟挑战仍然需要通过在附近的资源云服务器上执行资源密集型任务来解决。关键的挑战是找到最优的cloudlet来执行任务以节省计算时间。在异构MCC系统中,提出了一种基于云选择的轮循算法。本文考虑服务器的负载和距离,以找到最优的cloudlet,并最大限度地减少用户请求在服务器队列上的等待时间。此外,作者还对该算法进行了数学评价,并与现有的负载均衡算法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.70
自引率
10.00%
发文量
24
×
引用
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学术官方微信