移动边缘多目标资源共享与分配的博弈论方法

Faheem Zafari, Jian Li, K. Leung, D. Towsley, A. Swami
{"title":"移动边缘多目标资源共享与分配的博弈论方法","authors":"Faheem Zafari, Jian Li, K. Leung, D. Towsley, A. Swami","doi":"10.1145/3266276.3266277","DOIUrl":null,"url":null,"abstract":"Mobile edge computing seeks to provide resources to different delay-sensitive applications. However, allocating the limited edge resources to a number of applications is a challenging problem. To alleviate the resource scarcity problem, we propose sharing of resources among multiple edge computing service providers where each service provider has a particular utility to optimize. We model the resource allocation and sharing problem as a multi-objective optimization problem and present a Cooperative Game Theory (CGT) based framework, where each edge service provider first satisfies its native applications and then shares its remaining resources (if available) with users of other providers. Furthermore, we propose an ~O (N) algorithm that provides allocation decisions from the core, hence the obtained allocations are Pareto optimal and the grand coalition of all the service providers is stable. Experimental results show that our proposed resource allocation and sharing framework improves the utility of all the service providers compared with the case where the service providers are working alone (no resource sharing). Our ~O (N) algorithm reduces the time complexity of obtaining a solution from the core by as much as 71.67% when compared with the Shapley value.","PeriodicalId":365026,"journal":{"name":"Proceedings of the 2018 on Technologies for the Wireless Edge Workshop","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A Game-Theoretic Approach to Multi-Objective Resource Sharing and Allocation in Mobile Edge\",\"authors\":\"Faheem Zafari, Jian Li, K. Leung, D. Towsley, A. Swami\",\"doi\":\"10.1145/3266276.3266277\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile edge computing seeks to provide resources to different delay-sensitive applications. However, allocating the limited edge resources to a number of applications is a challenging problem. To alleviate the resource scarcity problem, we propose sharing of resources among multiple edge computing service providers where each service provider has a particular utility to optimize. We model the resource allocation and sharing problem as a multi-objective optimization problem and present a Cooperative Game Theory (CGT) based framework, where each edge service provider first satisfies its native applications and then shares its remaining resources (if available) with users of other providers. Furthermore, we propose an ~O (N) algorithm that provides allocation decisions from the core, hence the obtained allocations are Pareto optimal and the grand coalition of all the service providers is stable. Experimental results show that our proposed resource allocation and sharing framework improves the utility of all the service providers compared with the case where the service providers are working alone (no resource sharing). Our ~O (N) algorithm reduces the time complexity of obtaining a solution from the core by as much as 71.67% when compared with the Shapley value.\",\"PeriodicalId\":365026,\"journal\":{\"name\":\"Proceedings of the 2018 on Technologies for the Wireless Edge Workshop\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2018 on Technologies for the Wireless Edge Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3266276.3266277\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2018 on Technologies for the Wireless Edge Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3266276.3266277","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

移动边缘计算寻求为不同的延迟敏感应用程序提供资源。然而,将有限的边缘资源分配给许多应用程序是一个具有挑战性的问题。为了缓解资源短缺问题,我们建议在多个边缘计算服务提供商之间共享资源,其中每个服务提供商都有一个特定的实用程序来优化。我们将资源分配和共享问题建模为一个多目标优化问题,并提出了一个基于合作博弈论(CGT)的框架,其中每个边缘服务提供商首先满足其本地应用程序,然后与其他提供商的用户共享其剩余资源(如果可用)。此外,我们提出了一种~O (N)算法,该算法从核心提供分配决策,因此所得到的分配是帕累托最优的,并且所有服务提供者的大联盟是稳定的。实验结果表明,与服务提供商单独工作(没有资源共享)的情况相比,我们提出的资源分配和共享框架提高了所有服务提供商的效用。与Shapley值相比,我们的~O (N)算法将从核心获得解的时间复杂度降低了71.67%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Game-Theoretic Approach to Multi-Objective Resource Sharing and Allocation in Mobile Edge
Mobile edge computing seeks to provide resources to different delay-sensitive applications. However, allocating the limited edge resources to a number of applications is a challenging problem. To alleviate the resource scarcity problem, we propose sharing of resources among multiple edge computing service providers where each service provider has a particular utility to optimize. We model the resource allocation and sharing problem as a multi-objective optimization problem and present a Cooperative Game Theory (CGT) based framework, where each edge service provider first satisfies its native applications and then shares its remaining resources (if available) with users of other providers. Furthermore, we propose an ~O (N) algorithm that provides allocation decisions from the core, hence the obtained allocations are Pareto optimal and the grand coalition of all the service providers is stable. Experimental results show that our proposed resource allocation and sharing framework improves the utility of all the service providers compared with the case where the service providers are working alone (no resource sharing). Our ~O (N) algorithm reduces the time complexity of obtaining a solution from the core by as much as 71.67% when compared with the Shapley value.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Care to Share?: An Empirical Analysis of Capacity Enhancement by Sharing at the Edge Session details: Topics in Edge Computing Session details: Mobile Edge Computing Session details: Caching Networks Proceedings of the 2018 on Technologies for the Wireless Edge Workshop
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1