长期最大最小公平保障机制:mec网络中的自适应任务分割和资源分配

Zewei Jing, Qinghai Yang, Meng Qin, K. Kwak
{"title":"长期最大最小公平保障机制:mec网络中的自适应任务分割和资源分配","authors":"Zewei Jing, Qinghai Yang, Meng Qin, K. Kwak","doi":"10.1109/PIMRCW.2019.8880847","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an adaptive cross-system resource allocation algorithm while taking into account the long term max-min fairness in the emerging multi-access edge computing (MEC) networks. Specifically, we consider a novel MEC framework which allows smart devices (SDs) to offload their tasks simultaneously to multiple MEC servers through multiple radio access technologies (multi-RATs). In particular, the long term max-min fairness problem is modeled as the stochastic maximization of the minimum time averaged SD utility by jointly considering the SD task splitting, communication and MEC computation resource allocation. To make the formulated problem tractable, we first convert it to a time averaged stochastic maximization problem by an equivalent transformation. Then, an adaptive task splitting and resource allocation algorithm is proposed based on the Lyapunov optimization technique, which makes decisions only according to the current network status and queue state information, without a prior distribution knowledge. Extensive simulations show that the Jain's fairness index of our proposed algorithm can converge to closely 1 quickly and outperforms the traditional sum rate based algorithm.","PeriodicalId":158659,"journal":{"name":"2019 IEEE 30th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Long Term Max-min Fairness Guarantee Mechanism: Adaptive Task Splitting and Resource Allocation in MEC-enabled Networks\",\"authors\":\"Zewei Jing, Qinghai Yang, Meng Qin, K. Kwak\",\"doi\":\"10.1109/PIMRCW.2019.8880847\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an adaptive cross-system resource allocation algorithm while taking into account the long term max-min fairness in the emerging multi-access edge computing (MEC) networks. Specifically, we consider a novel MEC framework which allows smart devices (SDs) to offload their tasks simultaneously to multiple MEC servers through multiple radio access technologies (multi-RATs). In particular, the long term max-min fairness problem is modeled as the stochastic maximization of the minimum time averaged SD utility by jointly considering the SD task splitting, communication and MEC computation resource allocation. To make the formulated problem tractable, we first convert it to a time averaged stochastic maximization problem by an equivalent transformation. Then, an adaptive task splitting and resource allocation algorithm is proposed based on the Lyapunov optimization technique, which makes decisions only according to the current network status and queue state information, without a prior distribution knowledge. Extensive simulations show that the Jain's fairness index of our proposed algorithm can converge to closely 1 quickly and outperforms the traditional sum rate based algorithm.\",\"PeriodicalId\":158659,\"journal\":{\"name\":\"2019 IEEE 30th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC Workshops)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 30th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRCW.2019.8880847\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 30th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRCW.2019.8880847","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文在新兴的多接入边缘计算(MEC)网络中,提出了一种考虑长期最大最小公平性的自适应跨系统资源分配算法。具体而言,我们考虑了一种新的MEC框架,该框架允许智能设备(sd)通过多种无线电接入技术(multi- rat)将其任务同时卸载到多个MEC服务器。其中,将长期最大最小公平性问题建模为综合考虑SD任务划分、通信和MEC计算资源分配的最小时间平均SD效用的随机最大化问题。为了使公式问题易于处理,我们首先通过等效变换将其转化为时间平均随机最大化问题。然后,提出了一种基于Lyapunov优化技术的自适应任务分割和资源分配算法,该算法仅根据当前网络状态和队列状态信息进行决策,而不需要先验分布知识。大量的仿真结果表明,该算法的Jain公平性指数可以快速收敛到接近1,优于传统的基于和速率的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Long Term Max-min Fairness Guarantee Mechanism: Adaptive Task Splitting and Resource Allocation in MEC-enabled Networks
In this paper, we propose an adaptive cross-system resource allocation algorithm while taking into account the long term max-min fairness in the emerging multi-access edge computing (MEC) networks. Specifically, we consider a novel MEC framework which allows smart devices (SDs) to offload their tasks simultaneously to multiple MEC servers through multiple radio access technologies (multi-RATs). In particular, the long term max-min fairness problem is modeled as the stochastic maximization of the minimum time averaged SD utility by jointly considering the SD task splitting, communication and MEC computation resource allocation. To make the formulated problem tractable, we first convert it to a time averaged stochastic maximization problem by an equivalent transformation. Then, an adaptive task splitting and resource allocation algorithm is proposed based on the Lyapunov optimization technique, which makes decisions only according to the current network status and queue state information, without a prior distribution knowledge. Extensive simulations show that the Jain's fairness index of our proposed algorithm can converge to closely 1 quickly and outperforms the traditional sum rate based algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Generalized Spatial Modulation in Highly Correlated Channels Cramer-Rao Lower Bounds for Magnetic Localization of a Wireless Capsule Endoscope based on the Magnetic Dipole Model Long Term Max-min Fairness Guarantee Mechanism: Adaptive Task Splitting and Resource Allocation in MEC-enabled Networks Energy Metamorphic Testing for Android Applications Full Duplex for Next Generation of 802.11
×
引用
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