A Real-Time Task Offloading Strategy Based on Double Auction for Optimal Resource Allocation in Edge Computing

Zhipeng Gao, Congcong Yao, Kaile Xiao, Zijia Mo, Qian Wang, Yang Yang
{"title":"A Real-Time Task Offloading Strategy Based on Double Auction for Optimal Resource Allocation in Edge Computing","authors":"Zhipeng Gao, Congcong Yao, Kaile Xiao, Zijia Mo, Qian Wang, Yang Yang","doi":"10.1109/FiCloud.2019.00010","DOIUrl":null,"url":null,"abstract":"Task offloading in edge computing becomes an effective method to extend the computation ability of user equipments (UEs), via migrating computation-intensive applications from UEs to edge servers. However, not only locality-aware resource allocation for UEs and various edge computing services providers (ESPs) but also network economics for profit-driven ESPs and UEs is still a big challenge in task offloading. In this paper, we propose an edge computing resource allocation model based on the continuous-cycle double auction mechanism (RABDA). Considering the emergency of task offloaded, we also propose real-time offloading strategy (RTOS) to ensure tasks are processed efficiently. We use genetic algorithm to determine the winner ESPs which are responsible for providing computational resources to UEs, and verify the performance of our algorithm by contrast experiment. The simulation results show that our algorithm can improve satisfaction between UEs and ESPs, and it has higher resource utilization than the existing algorithm.","PeriodicalId":268882,"journal":{"name":"2019 7th International Conference on Future Internet of Things and Cloud (FiCloud)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 7th International Conference on Future Internet of Things and Cloud (FiCloud)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FiCloud.2019.00010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Task offloading in edge computing becomes an effective method to extend the computation ability of user equipments (UEs), via migrating computation-intensive applications from UEs to edge servers. However, not only locality-aware resource allocation for UEs and various edge computing services providers (ESPs) but also network economics for profit-driven ESPs and UEs is still a big challenge in task offloading. In this paper, we propose an edge computing resource allocation model based on the continuous-cycle double auction mechanism (RABDA). Considering the emergency of task offloaded, we also propose real-time offloading strategy (RTOS) to ensure tasks are processed efficiently. We use genetic algorithm to determine the winner ESPs which are responsible for providing computational resources to UEs, and verify the performance of our algorithm by contrast experiment. The simulation results show that our algorithm can improve satisfaction between UEs and ESPs, and it has higher resource utilization than the existing algorithm.
一种基于双拍卖的边缘计算资源优化实时任务分流策略
边缘计算中的任务卸载通过将计算密集型应用从终端迁移到边缘服务器,成为扩展终端计算能力的一种有效方法。然而,无论是终端和各种边缘计算服务提供商(esp)的位置感知资源分配,还是利润驱动的esp和终端的网络经济,在任务卸载方面仍然是一个巨大的挑战。本文提出了一种基于连续周期双拍卖机制(RABDA)的边缘计算资源分配模型。考虑到任务卸载的紧急性,提出了实时卸载策略(RTOS),以保证任务的高效处理。利用遗传算法确定负责为ue提供计算资源的优胜者esp,并通过对比实验验证算法的性能。仿真结果表明,该算法可以提高ue和esp之间的满意度,并且比现有算法具有更高的资源利用率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信