当前位置: X-MOL 学术arXiv.cs.NI › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An agile and distributed mechanism for inter-domain network slicing in next generation mobile networks
arXiv - CS - Networking and Internet Architecture Pub Date : 2021-02-21 , DOI: arxiv-2102.10687
Jalal Khamse-Ashari, Gamini Senarath, Irem Bor-Yaliniz, Halim Yanikomeroglu

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.

中文翻译:

下一代移动网络中域间网络切片的敏捷和分布式机制

网络切片正在成为一种有前途的方法,以提供广受欢迎的多功能性和灵活性来应对不断增长的需求。为了实现这种潜在优势并按需满足各种网络切片的挑战性需求,我们需要开发一种敏捷的分布式机制,以在异构多资源多域移动网络环境中向不同的网络切片提供资源。我们在一种优化问题的环境中为网片制定域间资源供应,这种优化问题可以使网片租户之间的社会福利最大化(从而使租户的满意度最大化),同时将基础架构服务提供商的运营支出降至最低。为了解决预想的问题,我们一方面在网络切片租户之间,另一方面在多个定价子网服务提供商之间实施迭代拍卖游戏。我们表明,所提出的解决方案方法导致了分布式隐私保护机制,该机制收敛于所描述的优化问题的最优解决方案。除了提供分析结果以表征所提出机制的性能外,我们还使用数值评估来验证结果,证明所提出算法的收敛性并展示所提出方法的增强性能(在资源利用,公平性和可靠性方面)。运营成本)与现有解决方案相比。我们表明,所提出的解决方案方法导致了分布式隐私保护机制,该机制收敛于所描述的优化问题的最优解决方案。除了提供分析结果以表征所提出机制的性能之外,我们还使用数值评估来验证结果,证明所提出算法的收敛性并展示所提出方法的增强性能(在资源利用率,公平性和可靠性方面)。运营成本)与现有解决方案相比。我们表明,所提出的解决方案方法导致了分布式隐私保护机制,该机制收敛于所描述的优化问题的最优解决方案。除了提供分析结果以表征所提出机制的性能之外,我们还使用数值评估来验证结果,证明所提出算法的收敛性并展示所提出方法的增强性能(在资源利用率,公平性和可靠性方面)。运营成本)与现有解决方案相比。
更新日期:2021-02-23
down
wechat
bug