当前位置: X-MOL 学术arXiv.cs.NI › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Coverage-Aware Resource Provisioning Method for Network Slicing
arXiv - CS - Networking and Internet Architecture Pub Date : 2019-07-22 , DOI: arxiv-1907.09211
Quang-Trung Luu, Sylvaine Kerboeuf, Alexandre Mouradian, and Michel Kieffer

With network slicing in 5G networks, Mobile Network Operators can create various slices for Service Providers (SPs) to accommodate customized services. Usually, the various Service Function Chains (SFCs) belonging to a slice are deployed on a best-effort basis. Nothing ensures that the Infrastructure Provider (InP) will be able to allocate enough resources to cope with the increasing demands of some SP. Moreover, in many situations, slices have to be deployed over some geographical area: coverage as well as minimum per-user rate constraints have then to be taken into account. This paper takes the InP perspective and proposes a slice resource provisioning approach to cope with multiple slice demands in terms of computing, storage, coverage, and rate constraints. The resource requirements of the various SFCs within a slice are aggregated within a graph of Slice Resource Demands (SRD). Infrastructure nodes and links have then to be provisioned so as to satisfy all SRDs. This problem leads to a Mixed Integer Linear Programming formulation. A two-step approach is considered, with several variants, depending on whether the constraints of each slice to be provisioned are taken into account sequentially or jointly. Once provisioning has been performed, any slice deployment strategy may be considered on the reduced-size infrastructure graph on which resources have been provisioned. Simulation results demonstrate the effectiveness of the proposed approach compared to a more classical direct slice embedding approach.

中文翻译:

一种用于网络切片的覆盖感知资源配置方法

通过 5G 网络中的网络切片,移动网络运营商可以为服务提供商 (SP) 创建各种切片以适应定制服务。通常,属于一个切片的各种服务功能链 (SFC) 都是在尽力而为的基础上部署的。没有什么能确保基础设施提供商 (InP) 能够分配足够的资源来应对某些 SP 日益增长的需求。此外,在许多情况下,切片必须部署在某个地理区域:然后必须考虑覆盖范围以及每个用户的最低速率限制。本文从InP的角度,提出了一种切片资源提供的方法,以应对计算、存储、覆盖和速率约束方面的多切片需求。切片内各种 SFC 的资源需求汇总在切片资源需求 (SRD) 图中。然后必须提供基础设施节点和链路以满足所有 SRD。这个问题导致了混合整数线性规划公式。考虑了两步法,具有多种变体,这取决于要供应的每个切片的约束是按顺序还是联合考虑。一旦执行了供应,就可以在已供应资源的缩小规模的基础架构图上考虑任何切片部署策略。与更经典的直接切片嵌入方法相比,仿真结果证明了所提出方法的有效性。然后必须提供基础设施节点和链路以满足所有 SRD。这个问题导致了混合整数线性规划公式。考虑了两步法,具有多种变体,这取决于要供应的每个切片的约束是按顺序还是联合考虑。一旦执行了供应,就可以在已供应资源的缩小规模的基础架构图上考虑任何切片部署策略。与更经典的直接切片嵌入方法相比,仿真结果证明了所提出方法的有效性。然后必须提供基础设施节点和链路以满足所有 SRD。这个问题导致了混合整数线性规划公式。考虑了两步法,具有多种变体,这取决于要供应的每个切片的约束是按顺序还是联合考虑。一旦执行了供应,就可以在已供应资源的缩小规模的基础架构图上考虑任何切片部署策略。与更经典的直接切片嵌入方法相比,仿真结果证明了所提出方法的有效性。取决于要提供的每个切片的约束是顺序考虑还是联合考虑。一旦执行了供应,就可以在已供应资源的缩小规模的基础架构图上考虑任何切片部署策略。与更经典的直接切片嵌入方法相比,仿真结果证明了所提出方法的有效性。取决于要提供的每个切片的约束是顺序考虑还是联合考虑。一旦执行了供应,就可以在已供应资源的缩小规模的基础架构图上考虑任何切片部署策略。与更经典的直接切片嵌入方法相比,仿真结果证明了所提出方法的有效性。
更新日期:2020-08-24
down
wechat
bug