一种分布式多阶段计算卸载算法

Tobias Mahn, Dennis Becker, Hussein Al-Shatri, A. Klein
{"title":"一种分布式多阶段计算卸载算法","authors":"Tobias Mahn, Dennis Becker, Hussein Al-Shatri, A. Klein","doi":"10.1109/CloudNet.2018.8549534","DOIUrl":null,"url":null,"abstract":"A scenario consisting of several mobile users, an access point (AP) and a cloud server in a multi-stage hierarchy is considered. Each user has a computation task which can be computed locally or offloaded to the AP or to the cloud server. Considering the shared access channel between users and the AP, the shared computation resources at the AP and the shared backhaul link connection from the AP to the cloud, an energy minimization computation offloading problem with a time constraint is tackled. The time constraint guarantees that the offloading time will not exceed the local computation time. In this paper, we propose a distributed game theoretic algorithm which decomposes the offloading problem into the subproblems of resource allocation and offloading decisions. The algorithm works iteratively between the two subproblems as follows: The AP receives offloading decisions from the users and accordingly optimizes the fractions of the bandwidth on the access channel, the fractions of the backhaul link rate and the fractions of the computation resource at the AP for all offloading users. Based on the assigned resources, each user autonomously decides between local computation or offloading to the AP or to the cloud server and reports its decision to the AP. Our proposed algorithm is shown to require only limited signaling between users and AP and converges in significantly few iterations. Furthermore, the results show that our algorithm performs close to the optimal policy.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Distributed Algorithm for Multi-Stage Computation Offloading\",\"authors\":\"Tobias Mahn, Dennis Becker, Hussein Al-Shatri, A. Klein\",\"doi\":\"10.1109/CloudNet.2018.8549534\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A scenario consisting of several mobile users, an access point (AP) and a cloud server in a multi-stage hierarchy is considered. Each user has a computation task which can be computed locally or offloaded to the AP or to the cloud server. Considering the shared access channel between users and the AP, the shared computation resources at the AP and the shared backhaul link connection from the AP to the cloud, an energy minimization computation offloading problem with a time constraint is tackled. The time constraint guarantees that the offloading time will not exceed the local computation time. In this paper, we propose a distributed game theoretic algorithm which decomposes the offloading problem into the subproblems of resource allocation and offloading decisions. The algorithm works iteratively between the two subproblems as follows: The AP receives offloading decisions from the users and accordingly optimizes the fractions of the bandwidth on the access channel, the fractions of the backhaul link rate and the fractions of the computation resource at the AP for all offloading users. Based on the assigned resources, each user autonomously decides between local computation or offloading to the AP or to the cloud server and reports its decision to the AP. Our proposed algorithm is shown to require only limited signaling between users and AP and converges in significantly few iterations. Furthermore, the results show that our algorithm performs close to the optimal policy.\",\"PeriodicalId\":436842,\"journal\":{\"name\":\"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CloudNet.2018.8549534\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CloudNet.2018.8549534","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

考虑一个由多个移动用户、一个接入点(AP)和一个多级层次结构的云服务器组成的场景。每个用户都有一个计算任务,可以在本地计算,也可以卸载到AP或云服务器。考虑用户与AP之间的共享访问通道、AP上的共享计算资源以及AP与云之间的共享回程链路连接,解决了具有时间约束的能量最小化计算卸载问题。时间约束保证卸载时间不会超过本地计算时间。本文提出了一种分布式博弈论算法,将卸载问题分解为资源分配子问题和卸载决策子问题。该算法在两个子问题之间进行迭代:AP接收用户的卸载决策,并相应地优化所有卸载用户在AP上的接入信道带宽分数、回程链路速率分数和计算资源分数。基于分配的资源,每个用户自主决定本地计算或卸载到AP或云服务器,并将其决定报告给AP。我们提出的算法只需要用户和AP之间有限的信令,并且在很少的迭代中收敛。此外,结果表明,我们的算法执行接近最优策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Distributed Algorithm for Multi-Stage Computation Offloading
A scenario consisting of several mobile users, an access point (AP) and a cloud server in a multi-stage hierarchy is considered. Each user has a computation task which can be computed locally or offloaded to the AP or to the cloud server. Considering the shared access channel between users and the AP, the shared computation resources at the AP and the shared backhaul link connection from the AP to the cloud, an energy minimization computation offloading problem with a time constraint is tackled. The time constraint guarantees that the offloading time will not exceed the local computation time. In this paper, we propose a distributed game theoretic algorithm which decomposes the offloading problem into the subproblems of resource allocation and offloading decisions. The algorithm works iteratively between the two subproblems as follows: The AP receives offloading decisions from the users and accordingly optimizes the fractions of the bandwidth on the access channel, the fractions of the backhaul link rate and the fractions of the computation resource at the AP for all offloading users. Based on the assigned resources, each user autonomously decides between local computation or offloading to the AP or to the cloud server and reports its decision to the AP. Our proposed algorithm is shown to require only limited signaling between users and AP and converges in significantly few iterations. Furthermore, the results show that our algorithm performs close to the optimal policy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信