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网络中,移动网络操作员可以为服务供应商创造各种切片,以适应定制服务。通常,属于切片的各种服务功能链(SFC)是在最佳努力的基础上部署的。没有什么能确保基础设施提供商(InP)能够分配足够的资源来应付某些SP不断增长的需求。此外,在许多情况下,必须在某些地理区域部署切片:然后必须考虑到覆盖和最低用户比率限制。本文件从InP角度出发,提出一种切片资源供给办法,以应对计算、储存、覆盖和费率限制方面的多种切片需求。一个切片中的各种SFC公司的资源需求在“切片资源需求”图中汇总。然后,提供基础设施节点和链接,以满足所有SRD。这个问题导致混合Interger线方法的制定。考虑采取两步办法,并有几种变式,这取决于每个切片的制约因素与提供中每个切片的需求在计算、储存、覆盖范围和费率限制方面。一个切片中的各种资源需求将在一个切片需求中进行汇总。随后提供,先考虑将多少次,然后再考虑在直切片战略中进行。