{"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%.