多小区移动边缘计算的业务迁移

Zezu Liang, Yuan Liu, T. Lok, Kaibin Huang
{"title":"多小区移动边缘计算的业务迁移","authors":"Zezu Liang, Yuan Liu, T. Lok, Kaibin Huang","doi":"10.1109/GLOBECOM42002.2020.9348247","DOIUrl":null,"url":null,"abstract":"Mobile-edge computing (MEC) enhances the capacities and features of mobile devices via offloading computation-intensive tasks over wireless networks to the edge servers. One challenge faced by the deployment of MEC in cellular networks is to support user mobility, so that the offloaded tasks can be seamlessly migrated between base stations (BSs) without compromising the resource-utilization efficiency and link reliability. In this paper, we tackle the challenge by optimizing the policy for migration/handover between BSs by jointly managing computation-and-radio resources. The policy design is formulated as a multi-objective optimization problem that maximizes the sum offloading rate, quantifying MEC throughput, and minimizes the migration cost, where the issues of virtualization, I/O interference between virtual machines (VMs), and wireless multi-access are taken into account. To solve the complex combinatorial problem, we develop an efficient relaxation-and-rounding based approach, including an optimal iterative algorithm for solving the integer-relaxed problem and a novel integer-recovery design that exploits the derived problem properties. The simulation results show the close-to-optimal performance of the proposed migration policies under various settings, validating their efficiency in computation-and-radio resource management for joint service migration and BS handover in multi-cell MEC networks.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"124 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Service Migration for Multi-Cell Mobile Edge Computing\",\"authors\":\"Zezu Liang, Yuan Liu, T. Lok, Kaibin Huang\",\"doi\":\"10.1109/GLOBECOM42002.2020.9348247\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile-edge computing (MEC) enhances the capacities and features of mobile devices via offloading computation-intensive tasks over wireless networks to the edge servers. One challenge faced by the deployment of MEC in cellular networks is to support user mobility, so that the offloaded tasks can be seamlessly migrated between base stations (BSs) without compromising the resource-utilization efficiency and link reliability. In this paper, we tackle the challenge by optimizing the policy for migration/handover between BSs by jointly managing computation-and-radio resources. The policy design is formulated as a multi-objective optimization problem that maximizes the sum offloading rate, quantifying MEC throughput, and minimizes the migration cost, where the issues of virtualization, I/O interference between virtual machines (VMs), and wireless multi-access are taken into account. To solve the complex combinatorial problem, we develop an efficient relaxation-and-rounding based approach, including an optimal iterative algorithm for solving the integer-relaxed problem and a novel integer-recovery design that exploits the derived problem properties. The simulation results show the close-to-optimal performance of the proposed migration policies under various settings, validating their efficiency in computation-and-radio resource management for joint service migration and BS handover in multi-cell MEC networks.\",\"PeriodicalId\":12759,\"journal\":{\"name\":\"GLOBECOM 2020 - 2020 IEEE Global Communications Conference\",\"volume\":\"124 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"GLOBECOM 2020 - 2020 IEEE Global Communications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOBECOM42002.2020.9348247\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM42002.2020.9348247","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

移动边缘计算(MEC)通过无线网络将计算密集型任务卸载到边缘服务器,从而增强了移动设备的容量和特性。在蜂窝网络中部署MEC面临的一个挑战是支持用户的移动性,以便卸载的任务可以在基站(BSs)之间无缝迁移,而不影响资源利用效率和链路可靠性。在本文中,我们通过联合管理计算和无线电资源来优化BSs之间的迁移/切换策略来解决这一挑战。策略设计是一个多目标优化问题,考虑虚拟化、虚拟机(vm)之间的I/O干扰和无线多址访问等问题,最大限度地提高总卸载率、量化MEC吞吐量和最小化迁移成本。为了解决复杂的组合问题,我们开发了一种有效的基于松弛和舍入的方法,包括解决整数松弛问题的最优迭代算法和利用派生问题性质的新颖整数恢复设计。仿真结果表明,所提出的迁移策略在不同设置下的性能接近最优,验证了其在多小区MEC网络中联合业务迁移和BS切换的计算和无线电资源管理方面的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Service Migration for Multi-Cell Mobile Edge Computing
Mobile-edge computing (MEC) enhances the capacities and features of mobile devices via offloading computation-intensive tasks over wireless networks to the edge servers. One challenge faced by the deployment of MEC in cellular networks is to support user mobility, so that the offloaded tasks can be seamlessly migrated between base stations (BSs) without compromising the resource-utilization efficiency and link reliability. In this paper, we tackle the challenge by optimizing the policy for migration/handover between BSs by jointly managing computation-and-radio resources. The policy design is formulated as a multi-objective optimization problem that maximizes the sum offloading rate, quantifying MEC throughput, and minimizes the migration cost, where the issues of virtualization, I/O interference between virtual machines (VMs), and wireless multi-access are taken into account. To solve the complex combinatorial problem, we develop an efficient relaxation-and-rounding based approach, including an optimal iterative algorithm for solving the integer-relaxed problem and a novel integer-recovery design that exploits the derived problem properties. The simulation results show the close-to-optimal performance of the proposed migration policies under various settings, validating their efficiency in computation-and-radio resource management for joint service migration and BS handover in multi-cell MEC networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
AirID: Injecting a Custom RF Fingerprint for Enhanced UAV Identification using Deep Learning Oversampling Algorithm based on Reinforcement Learning in Imbalanced Problems FAST-RAM: A Fast AI-assistant Solution for Task Offloading and Resource Allocation in MEC Achieving Privacy-Preserving Vehicle Selection for Effective Content Dissemination in Smart Cities Age-optimal Transmission Policy for Markov Source with Differential Encoding
×
引用
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