A Nested Decomposition Model for Reliable NFV 5G Network Slicing

IF 4.7 2区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

IEEE Transactions on Network and Service Management Pub Date : 2023-09-27 DOI:10.1109/TNSM.2023.3303388

Brigitte Jaumard;Quang Huy Duong

{"title":"A Nested Decomposition Model for Reliable NFV 5G Network Slicing","authors":"Brigitte Jaumard;Quang Huy Duong","doi":"10.1109/TNSM.2023.3303388","DOIUrl":null,"url":null,"abstract":"With the 5th generation of mobile networking (5G) on our doorstep, optical network operators are reorganizing their network infrastructure to deploy different topologies (virtual networks/applications) on the same network infrastructure on demand. This new paradigm, called network slicing, can be enabled by segmenting the network resources based on the requirements of the application level. This paper investigates a nested decomposition mathematical modeling to design a reliable 5G network slicing problem, i.e., every virtual path is protected against any single link failures by a dedicated backup disjoint virtual path. This new modeling revises and improves some previously proposed decomposition models. Then, we propose a column generation algorithm to solve the new modeling exactly. Moreover, this paper provides the computation of dual bounds with Lagrangian relaxation to assess the solutions’ accuracy that many existing nested-decomposition applications have omitted. Extensive computational results show that we can get \n<inline-formula> <tex-math>$\\varepsilon $ </tex-math></inline-formula>\n-optimal reliable 5G slicing solutions with small \n<inline-formula> <tex-math>$\\varepsilon $ </tex-math></inline-formula>\n (about 2% on average) in fairly reasonable computational times. In addition, we also propose several acceleration schemes using parallel programming to reduce computational time. The experimental results show that the slice-based scheme outperforms the path-based one in terms of parallelism.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"20 3","pages":"2186-2200"},"PeriodicalIF":4.7000,"publicationDate":"2023-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10265246/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

With the 5th generation of mobile networking (5G) on our doorstep, optical network operators are reorganizing their network infrastructure to deploy different topologies (virtual networks/applications) on the same network infrastructure on demand. This new paradigm, called network slicing, can be enabled by segmenting the network resources based on the requirements of the application level. This paper investigates a nested decomposition mathematical modeling to design a reliable 5G network slicing problem, i.e., every virtual path is protected against any single link failures by a dedicated backup disjoint virtual path. This new modeling revises and improves some previously proposed decomposition models. Then, we propose a column generation algorithm to solve the new modeling exactly. Moreover, this paper provides the computation of dual bounds with Lagrangian relaxation to assess the solutions’ accuracy that many existing nested-decomposition applications have omitted. Extensive computational results show that we can get

$\varepsilon $

-optimal reliable 5G slicing solutions with small

$\varepsilon $

(about 2% on average) in fairly reasonable computational times. In addition, we also propose several acceleration schemes using parallel programming to reduce computational time. The experimental results show that the slice-based scheme outperforms the path-based one in terms of parallelism.

查看原文本刊更多论文

可靠NFV 5G网络切片的嵌套分解模型

随着第五代移动网络（5G）即将问世，光网络运营商正在重组其网络基础设施，以便根据需要在同一网络基础设施上部署不同的拓扑结构（虚拟网络/应用程序）。这种被称为网络切片的新范式可以通过根据应用程序级别的要求分割网络资源来实现。本文研究了一种嵌套分解数学模型，以设计一个可靠的5G网络切片问题，即通过一个专用的备份不相交虚拟路径来保护每个虚拟路径免受任何单链路故障的影响。这种新的建模对以前提出的一些分解模型进行了修正和改进。然后，我们提出了一种列生成算法来精确地解决新的建模问题。此外，本文还提供了拉格朗日松弛对偶界的计算，以评估许多现有嵌套分解应用程序遗漏的解的准确性。大量的计算结果表明，我们可以在相当合理的计算时间内，用较小的$\varepsilon$（平均约2%）获得$\varepilon$最优可靠的5G切片解决方案。此外，我们还提出了几种使用并行编程的加速方案，以减少计算时间。实验结果表明，基于切片的方案在并行性方面优于基于路径的方案。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications

CiteScore

9.30

自引率

15.10%

发文量

325

期刊介绍： IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.