论文标题
在不确定性下保证SLA的优先切片请求的入学控制和资源保留
Admission Control and Resource Reservation for Prioritized Slice Requests with Guaranteed SLA under Uncertainties
论文作者
论文摘要
网络切片已成为5G系统中的关键概念,允许移动网络运营商(MNOS)在由基础架构提供商(INP)管理的共享基础结构网络(INP)上构建孤立的逻辑网络(SLICE)。网络切片需要将基础架构网络资源分配到切片激活时间的虚拟网络组件,并调整用于操作的切片的资源。在最佳及时进行这些操作,无法保证提供足够的基础设施资源以满足切片要求。 本文提出了基于基础设施资源预订方法的同时切片的优先级入院控制机制。保留说明了切片请求的动态性质,同时对切片资源需求的不确定性进行了鲁棒性。提议采用INP的观点,建议保留计划,以最大程度地提高基础设施资源的切片数量,同时最大程度地减少向MNO的费用最小化。这就需要解决最大值优化问题,并具有非线性成本函数和非线性限制,这是由于对需求的不确定性的鲁棒性以及保留对背景服务的影响的限制所引起的。成本和约束是线性化的,并提出了几种减少复杂性策略来解决切片的入院控制和资源保留问题。仿真表明,可以通过差异化的接收延迟和切片资源请求的加工速度之间的差异选择来调整不同优先级级别的接收切片的比例。
Network slicing has emerged as a key concept in 5G systems, allowing Mobile Network Operators (MNOs) to build isolated logical networks (slices) on top of shared infrastructure networks managed by Infrastructure Providers (InP). Network slicing requires the assignment of infrastructure network resources to virtual network components at slice activation time and the adjustment of resources for slices under operation. Performing these operations just-in-time, on a best-effort basis, comes with no guarantee on the availability of enough infrastructure resources to meet slice requirements. This paper proposes a prioritized admission control mechanism for concurrent slices based on an infrastructure resource reservation approach. The reservation accounts for the dynamic nature of slice requests while being robust to uncertainties in slice resource demands. Adopting the perspective of an InP, reservation schemes are proposed that maximize the number of slices for which infrastructure resources can be granted while minimizing the costs charged to the MNOs. This requires the solution of a max-min optimization problem with a non-linear cost function and non-linear constraints induced by the robustness to uncertainties of demands and the limitation of the impact of reservation on background services. The cost and the constraints are linearized and several reduced-complexity strategies are proposed to solve the slice admission control and resource reservation problem. Simulations show that the proportion of admitted slices of different priority levels can be adjusted by a differentiated selection of the delay between the reception and the processing instants of a slice resource request.