An Economy-mode Framework for Task Offloading in Fog Computing Networks

Beibei Wang, Fei Shen, Xujie Li, F. Qin, Feng Yan, Siyuan Zhou
{"title":"An Economy-mode Framework for Task Offloading in Fog Computing Networks","authors":"Beibei Wang, Fei Shen, Xujie Li, F. Qin, Feng Yan, Siyuan Zhou","doi":"10.1109/WCSP.2019.8928050","DOIUrl":null,"url":null,"abstract":"In the fog network, by offtoading the computing tasks to the fog nodes (FNs) located at the edge of the network, the task processing delay of the terminal nodes (TNs) can be reduced significantly. However, not all the FNs are willing to help TNs for free. Therefore, an economy-mode framework for task offtoading in the fog network is required to motivate the FNs. In this paper, we formulate the task offtoading problem based on Stackelberg game. The TN with computing tasks acts as the leader and its strategy is the optimal unit computing price. Each FN with idle resources acts as the follower and its strategy is the sharable optimal proportion of computing capability. Firstly, the leader predicts the followers' strategies and provides the unit computing price. Next, given the price, the followers will do exactly what the leader wishes, which is the system optimal point. By maximizing the utility functions of both the TN and FNs, a win-win solution is obtained. The numerical simulations indicate the importance of our proposed economy-mode framework for task offtoading.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2019.8928050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In the fog network, by offtoading the computing tasks to the fog nodes (FNs) located at the edge of the network, the task processing delay of the terminal nodes (TNs) can be reduced significantly. However, not all the FNs are willing to help TNs for free. Therefore, an economy-mode framework for task offtoading in the fog network is required to motivate the FNs. In this paper, we formulate the task offtoading problem based on Stackelberg game. The TN with computing tasks acts as the leader and its strategy is the optimal unit computing price. Each FN with idle resources acts as the follower and its strategy is the sharable optimal proportion of computing capability. Firstly, the leader predicts the followers' strategies and provides the unit computing price. Next, given the price, the followers will do exactly what the leader wishes, which is the system optimal point. By maximizing the utility functions of both the TN and FNs, a win-win solution is obtained. The numerical simulations indicate the importance of our proposed economy-mode framework for task offtoading.
雾计算网络中任务卸载的经济模式框架
在雾网络中,通过将计算任务卸载到位于网络边缘的雾节点,可以显著降低终端节点的任务处理延迟。然而,并不是所有的FNs都愿意免费帮助TNs。因此,需要一个经济模式的雾网络任务卸载框架来激励FNs。本文提出了基于Stackelberg博弈的任务卸载问题。具有计算任务的TN作为领导者,其策略为最优单位计算价格。每个具有空闲资源的FN作为follower,其策略是计算能力的可共享最优比例。首先,领导者预测追随者的策略,并提供单位计算价格。接下来,在给定价格的情况下,追随者会完全按照领导者的意愿行事,这是系统的最优点。通过最大化TN和FNs的效用函数,获得双赢的解决方案。数值模拟表明了我们提出的经济模式框架对任务卸载的重要性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信