The Location Problem for the Provisioning of Protected Slices in NFV-Based MEC Infrastructure

IF 13.8 1区 计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Hernani D. Chantre, Nelson Luis Saldanha da Fonseca
{"title":"The Location Problem for the Provisioning of Protected Slices in NFV-Based MEC Infrastructure","authors":"Hernani D. Chantre, Nelson Luis Saldanha da Fonseca","doi":"10.1109/JSAC.2020.2986869","DOIUrl":null,"url":null,"abstract":"The support of stringent requirements such as ultra-low latency and ultra-reliability of the forthcoming 5G services poses several challenges to telecommunications infrastructure providers. Network Function Virtualization, multi-access edge computing (MEC), and network slicing capabilities can help the support of such requirements. However, a trade-off between the cost of resource deployment and the support of service requirements needs to be taken into account in the design of NFV-based 5G networks. In this paper, we investigate the MEC location problem, which aims at selecting locations to place MECs hosting protected slices. We propose a MEC location problem enhanced with 1: 1 and <inline-formula> <tex-math notation=\"LaTeX\">$1:N$ </tex-math></inline-formula> protection schemes for the provisioning of protected slices. In the 1: 1 scheme, protection is assured by reserving a backup slice for each tenant, whereas in the <inline-formula> <tex-math notation=\"LaTeX\">$1:N$ </tex-math></inline-formula> scheme, a backup slice is shared among <inline-formula> <tex-math notation=\"LaTeX\">$N$ </tex-math></inline-formula> tenants. The problem is modeled as a multi-criteria optimization problem and solved by the employment of a multi-objective evolutionary non-dominated sorting genetic algorithm. A comparison between the 1: 1 and <inline-formula> <tex-math notation=\"LaTeX\">$1:N$ </tex-math></inline-formula> protection schemes is carried out in the context of 5G network slicing. Results show that the protection scheme 1: 1 can reduce the response time, at a higher deployment cost when compared to the <inline-formula> <tex-math notation=\"LaTeX\">$1:N$ </tex-math></inline-formula> scheme.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1505-1514"},"PeriodicalIF":13.8000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2986869","citationCount":"29","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Journal on Selected Areas in Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/JSAC.2020.2986869","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 29

Abstract

The support of stringent requirements such as ultra-low latency and ultra-reliability of the forthcoming 5G services poses several challenges to telecommunications infrastructure providers. Network Function Virtualization, multi-access edge computing (MEC), and network slicing capabilities can help the support of such requirements. However, a trade-off between the cost of resource deployment and the support of service requirements needs to be taken into account in the design of NFV-based 5G networks. In this paper, we investigate the MEC location problem, which aims at selecting locations to place MECs hosting protected slices. We propose a MEC location problem enhanced with 1: 1 and $1:N$ protection schemes for the provisioning of protected slices. In the 1: 1 scheme, protection is assured by reserving a backup slice for each tenant, whereas in the $1:N$ scheme, a backup slice is shared among $N$ tenants. The problem is modeled as a multi-criteria optimization problem and solved by the employment of a multi-objective evolutionary non-dominated sorting genetic algorithm. A comparison between the 1: 1 and $1:N$ protection schemes is carried out in the context of 5G network slicing. Results show that the protection scheme 1: 1 can reduce the response time, at a higher deployment cost when compared to the $1:N$ scheme.
基于nfv的MEC基础设施中保护片发放的定位问题
对即将推出的5G服务的超低延迟和超可靠性等严格要求的支持给电信基础设施提供商带来了一些挑战。网络功能虚拟化、多址边缘计算(MEC)和网络切片功能可以帮助支持这些需求。然而,在设计基于NFV的5G网络时,需要考虑资源部署成本和服务需求支持之间的权衡。在本文中,我们研究了MEC定位问题,该问题旨在选择放置托管受保护切片的MEC的位置。我们提出了一个用1:1和$1:N$保护方案增强的MEC位置问题,用于提供受保护的切片。在1:1方案中,通过为每个租户保留一个备份切片来确保保护,而在$1:N$方案中,备份切片在$N$租户之间共享。该问题被建模为一个多准则优化问题,并采用多目标进化非支配排序遗传算法进行求解。在5G网络切片的背景下,对1:1和$1:N$保护方案进行了比较。结果表明,与$1:N$方案相比,保护方案1:1可以以更高的部署成本减少响应时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
30.00
自引率
4.30%
发文量
234
审稿时长
6 months
期刊介绍: The IEEE Journal on Selected Areas in Communications (JSAC) is a prestigious journal that covers various topics related to Computer Networks and Communications (Q1) as well as Electrical and Electronic Engineering (Q1). Each issue of JSAC is dedicated to a specific technical topic, providing readers with an up-to-date collection of papers in that area. The journal is highly regarded within the research community and serves as a valuable reference. The topics covered by JSAC issues span the entire field of communications and networking, with recent issue themes including Network Coding for Wireless Communication Networks, Wireless and Pervasive Communications for Healthcare, Network Infrastructure Configuration, Broadband Access Networks: Architectures and Protocols, Body Area Networking: Technology and Applications, Underwater Wireless Communication Networks, Game Theory in Communication Systems, and Exploiting Limited Feedback in Tomorrow’s Communication Networks.
×
引用
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学术官方微信