论文标题

网络切片的不确定性感知资源提供

Uncertainty-Aware Resource Provisioning for Network Slicing

论文作者

Luu, Quang-Trung, Kerboeuf, Sylvaine, Kieffer, Michel

论文摘要

网络切片允许移动网络运营商将物理基础架构分为由服务提供商管理以适应定制服务的孤立虚拟网络(SLICE)。属于切片的服务功能链(SFC)通常部署在最佳前提下:没有任何保证网络基础架构资源足以支持各种用户,每个用户都有不确定的要求。从网络基础架构提供商(INP)的角度来看,本文提出了一种用于切片的资源配置方法,对一部分未知数量的用户稳健,并随机使用切片资源。供应计划旨在最大化INP的总收入,同时提供概率保证,即提供的网络资源数量将满足切片要求。此外,采用了拟议的配置方法,以限制其对低优先级背景服务的影响,这可能与基础架构网络中的切片共存。提出了切片资源提供问题的混合整数线性编程公式。提出了最佳的关节和次优连溶液。将这些解决方案与不说出共享共同基础架构网络的最佳及时服务的供应计划进行了比较。

Network slicing allows Mobile Network Operators to split the physical infrastructure into isolated virtual networks (slices), managed by Service Providers to accommodate customized services. The Service Function Chains (SFCs) belonging to a slice are usually deployed on a best-effort premise: nothing guarantees that network infrastructure resources will be sufficient to support a varying number of users, each with uncertain requirements. Taking the perspective of a network Infrastructure Provider (InP), this paper proposes a resource provisioning approach for slices, robust to a partly unknown number of users with random usage of the slice resources. The provisioning scheme aims to maximize the total earnings of the InP, while providing a probabilistic guarantee that the amount of provisioned network resources will meet the slice requirements. Moreover, the proposed provisioning approach is performed so as to limit its impact on low-priority background services, which may co-exist with slices in the infrastructure network. A Mixed Integer Linear Programming formulation of the slice resource provisioning problem is proposed. Optimal joint and suboptimal sequential solutions are proposed. These solutions are compared to a provisioning scheme that does not account for best-effort services sharing the common infrastructure network.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源