Network slicing is emerging as a promising method to provide sought-after versatility and flexibility to cope with ever-increasing demands. To realize such potential advantages and to meet the challenging requirements of various network slices in an on-demand fashion, we need to develop an agile and distributed mechanism for resource provisioning to different network slices in a heterogeneous multi-resource multi-domain mobile network environment. We formulate inter-domain resource provisioning to network slices in such an environment as an optimization problem which maximizes social welfare among network slice tenants (so that maximizing tenants' satisfaction), while minimizing operational expenditures for infrastructure service providers at the same time. To solve the envisioned problem, we implement an iterative auction game among network slice tenants, on one hand, and a plurality of price-taking subnet service providers, on the other hand. We show that the proposed solution method results in a distributed privacy-saving mechanism which converges to the optimal solution of the described optimization problem. In addition to providing analytical results to characterize the performance of the proposed mechanism, we also employ numerical evaluations to validate the results, demonstrate convergence of the presented algorithm, and show the enhanced performance of the proposed approach (in terms of resource utilization, fairness and operational costs) against the existing solutions.
翻译:为了实现这些潜在优势,并以需求方式满足各种网络切片的挑战性需求,我们需要建立一个灵活和分散的机制,在一个多资源多领域移动网络环境中向不同网络切片提供资源。我们为网络切片设计了一个最优化的问题,在这种环境中,为网络切片设计一个跨部资源供给,这是优化问题,使网络切片租户的社会福利最大化(从而最大限度地提高租户的满意度),同时最大限度地减少基础设施服务供应商的业务支出。为了解决所设想的问题,我们一方面在网络切片租户之间实施迭代拍卖游戏,另一方面在多种次网网服务供应商之间实施多种定价子。我们表明,拟议解决方案导致一个分散的隐私保存机制,该机制与所述优化问题的最佳解决方案相匹配。除了提供分析结果,以说明拟议机制的绩效,我们还采用数字评估来验证结果,显示所介绍的算法趋同,并显示拟议方法(在资源利用公平性、成本和现有解决方案方面)的强化绩效。