SP-ADMM: a distributed optimization method of SFC placement for 5G-MEC networks

Zhibo Zhang, Hui-qiang Wang, Shuangyue Niu, Hongwu Lv
{"title":"SP-ADMM: a distributed optimization method of SFC placement for 5G-MEC networks","authors":"Zhibo Zhang, Hui-qiang Wang, Shuangyue Niu, Hongwu Lv","doi":"10.1117/12.3031950","DOIUrl":null,"url":null,"abstract":"Recently, the combination of a service function chain (SFC) with network function virtualization (NFV) and softwaredefined networking (SDN) has provided customers with flexible and efficient services. The emergence of multi-access edge computing (MEC) further enhances the level of service customization. However, achieving joint optimization of virtual network function (VNF) deployment and flow allocation in resource-constrained scenarios while meeting the diverse requirements of 5G verticals is challenging. Current research rarely addresses dedicated service provisioning for edge servers and considers the additional instantiation overhead introduced by adjusting cloud server parameters. In fact, this is a non-negligible issue during SFC deployment in 5G-MEC scenarios. Based on the above considerations, this paper constructs a joint SFC deployment problem for edge-cloud networks with the goal of maximizing network utility. We first propose a univariate modeling method based on meta-links that effectively avoids the variable coupling problem in traditional multivariate modeling approaches and reduce the problem size by at least half. Subsequently, to solve the NPhard integer nonlinear problem (INLP), we propose a distributed computing architecture named SP-ADMM, which improves the speed and quality of SFC deployment in large-scale scenarios via convex combinatorial formulations and a Viterbi-based heuristic algorithm (PAC-GREP). Finally, we experimentally verify the convergence and approximation of the algorithms. Our solution demonstrates advantages in terms of network utility and convergence speed under the same network resources, increasing service capacity by at least 39%.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Algorithms, Microchips and Network Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.3031950","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Recently, the combination of a service function chain (SFC) with network function virtualization (NFV) and softwaredefined networking (SDN) has provided customers with flexible and efficient services. The emergence of multi-access edge computing (MEC) further enhances the level of service customization. However, achieving joint optimization of virtual network function (VNF) deployment and flow allocation in resource-constrained scenarios while meeting the diverse requirements of 5G verticals is challenging. Current research rarely addresses dedicated service provisioning for edge servers and considers the additional instantiation overhead introduced by adjusting cloud server parameters. In fact, this is a non-negligible issue during SFC deployment in 5G-MEC scenarios. Based on the above considerations, this paper constructs a joint SFC deployment problem for edge-cloud networks with the goal of maximizing network utility. We first propose a univariate modeling method based on meta-links that effectively avoids the variable coupling problem in traditional multivariate modeling approaches and reduce the problem size by at least half. Subsequently, to solve the NPhard integer nonlinear problem (INLP), we propose a distributed computing architecture named SP-ADMM, which improves the speed and quality of SFC deployment in large-scale scenarios via convex combinatorial formulations and a Viterbi-based heuristic algorithm (PAC-GREP). Finally, we experimentally verify the convergence and approximation of the algorithms. Our solution demonstrates advantages in terms of network utility and convergence speed under the same network resources, increasing service capacity by at least 39%.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
SP-ADMM:5G-MEC 网络 SFC 布置的分布式优化方法
最近,服务功能链(SFC)与网络功能虚拟化(NFV)和软件定义网络(SDN)的结合为客户提供了灵活高效的服务。多接入边缘计算(MEC)的出现进一步提高了服务定制化水平。然而,要在资源受限的情况下实现虚拟网络功能(VNF)部署和流量分配的联合优化,同时满足 5G 垂直行业的不同需求,是一项挑战。目前的研究很少涉及边缘服务器的专用服务供应,也很少考虑调整云服务器参数带来的额外实例化开销。事实上,在 5G-MEC 场景中部署 SFC 时,这是一个不可忽视的问题。基于上述考虑,本文以网络效用最大化为目标,构建了边缘-云网络的联合 SFC 部署问题。我们首先提出了一种基于元链接的单变量建模方法,有效避免了传统多变量建模方法中的变量耦合问题,将问题规模至少缩小了一半。随后,为了解决 NPhard 整数非线性问题(INLP),我们提出了一种名为 SP-ADMM 的分布式计算架构,该架构通过凸组合公式和基于 Viterbi 的启发式算法(PAC-GREP)提高了大规模场景中部署 SFC 的速度和质量。最后,我们通过实验验证了算法的收敛性和近似性。在网络资源相同的情况下,我们的解决方案在网络效用和收敛速度方面表现出优势,至少提高了 39% 的服务容量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Advanced deep-learning-based chip design enabling algorithmic and hardware architecture convergence Fusing lightweight Retinaface network for fatigue driving detection A local flooding-based survivable routing algorithm for mega-constellations networks with inclined orbits A privacy preserving carbon quota trading and auditing method DOA estimation based on mode and maximum eigenvector algorithm with reverberation environment
×
引用
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