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。此问题导致混合整数线性规划公式。考虑到有两个变体的两步方法，这取决于是顺序还是共同考虑要提供的每个分片的约束。一旦执行了预配置，就可以在已预配置了资源的小型基础结构图上考虑任何切片部署策略。