Task offloading in mobile edge computing using cost-based discounted optimal stopping

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
Saleh ALFahad, Qiyuan Wang, C. Anagnostopoulos, Kostas Kolomvatsos
{"title":"Task offloading in mobile edge computing using cost-based discounted optimal stopping","authors":"Saleh ALFahad, Qiyuan Wang, C. Anagnostopoulos, Kostas Kolomvatsos","doi":"10.1515/comp-2023-0115","DOIUrl":null,"url":null,"abstract":"\n Mobile edge computing (MEC) paradigm has emerged to improve the quality of service & experience of applications deployed in close proximity to end-users. Due to their restricted computational and communication resources, MEC nodes can provide access to a portion of the entire set of services and data gathered. Therefore, there are several obstacles to their management. Keeping track of all the services offered by the MEC nodes is challenging, particularly if their demand rates change over time. Received tasks (such as, analytics queries, classification tasks, and model learning) require services to be invoked in real MEC use-case scenarios, e.g., smart cities. It is not unusual for a node to lack the necessary services or part of them. Undeniably, not all the requested services may be locally available; thus, MEC nodes must deal with the timely and appropriate choice of whether to carry out a service replication (pull action) or tasks offloading (push action) to peer nodes in a MEC environment. In this study, we contribute with a novel time-optimized mechanism based on the optimal stopping theory, which is built on the cost-based decreasing service demand rates evidenced in various service management situations. Our mechanism tries to optimally solve the decision-making dilemma between pull and push action. The experimental findings of our mechanism and its comparative assessment with other methods found in the literature showcase the achieved optimal decisions with respect to certain cost-based objective functions over dynamic service demand rates.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/comp-2023-0115","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Mobile edge computing (MEC) paradigm has emerged to improve the quality of service & experience of applications deployed in close proximity to end-users. Due to their restricted computational and communication resources, MEC nodes can provide access to a portion of the entire set of services and data gathered. Therefore, there are several obstacles to their management. Keeping track of all the services offered by the MEC nodes is challenging, particularly if their demand rates change over time. Received tasks (such as, analytics queries, classification tasks, and model learning) require services to be invoked in real MEC use-case scenarios, e.g., smart cities. It is not unusual for a node to lack the necessary services or part of them. Undeniably, not all the requested services may be locally available; thus, MEC nodes must deal with the timely and appropriate choice of whether to carry out a service replication (pull action) or tasks offloading (push action) to peer nodes in a MEC environment. In this study, we contribute with a novel time-optimized mechanism based on the optimal stopping theory, which is built on the cost-based decreasing service demand rates evidenced in various service management situations. Our mechanism tries to optimally solve the decision-making dilemma between pull and push action. The experimental findings of our mechanism and its comparative assessment with other methods found in the literature showcase the achieved optimal decisions with respect to certain cost-based objective functions over dynamic service demand rates.
在移动边缘计算中使用基于成本的折现最优停止来卸载任务
移动边缘计算(MEC)模式的出现是为了提高部署在终端用户附近的应用程序的服务质量和体验。由于计算和通信资源有限,MEC 节点只能提供所收集的全部服务和数据中的一部分。因此,它们的管理存在一些障碍。跟踪 MEC 节点提供的所有服务具有挑战性,尤其是在其需求率随时间变化的情况下。接收的任务(如分析查询、分类任务和模型学习)需要在真实的 MEC 使用场景(如智能城市)中调用服务。节点缺乏必要服务或部分服务的情况并不少见。不可否认,并非所有请求的服务都能在本地获得;因此,在 MEC 环境中,MEC 节点必须及时、适当地选择是向对等节点进行服务复制(拉动作)还是任务卸载(推动作)。在本研究中,我们基于最优停止理论,提出了一种新颖的时间优化机制,该机制建立在各种服务管理情况下所证明的基于成本的服务需求递减率基础之上。我们的机制试图优化解决拉动和推动行动之间的决策困境。我们的机制的实验结果及其与文献中其他方法的比较评估,展示了在动态服务需求率的某些基于成本的目标函数方面所实现的最优决策。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
×
引用
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学术官方微信