Constrained Network Slicing Games: Achieving Service Guarantees and Network Efficiency
Constrained Network Slicing Games: Achieving Service Guarantees and Network Efficiency
复制标题
DOI：
10.1109/tnet.2023.3262810
复制
发表时间：
2023-12
期刊：
影响因子：
--
通讯作者：
Jiaxiao Zheng;Albert Banchs;G. Veciana
中科院分区：
文献类型：
--
作者：
Jiaxiao Zheng;Albert Banchs;G. Veciana
网络切片是下一代移动的网络的关键能力。它使基础设施提供商能够在共享基础设施上经济高效地定制逻辑网络。网络切片的一个关键组成部分是资源分配，这需要确保切片接收支持其服务所需的资源，同时优化网络效率。在本文中，我们提出了一种新的方法，以切片为基础的资源分配命名为保证服务效率的网络切片（GREET）。其基本概念是建立一个受约束的资源分配游戏，其中（$i$）切片单方面优化其分配，以最好地满足其（动态）客户负载，而（$ii$）约束是为了保证，如果他们希望这样，切片收到预先商定的网络资源份额。由此产生的游戏是著名的费雪市场的一个变体，其中切片被提供预算以争夺网络资源（如在传统的费雪市场中），但（与费雪市场不同）价格对某些资源进行限制，以确保每个切片都满足预先约定的保证。通过这种方式，GREET结合了基于共享的方法（通过灵活共享实现高效率）和基于预留的方法（通过分配固定数量的资源提供保证）的优点。我们描述了纳什均衡，最佳反应动力学，并提出了一个实用的切片策略，可证明的收敛性。广泛的模拟表现出实质性的改进，网络切片国家的最先进的基准。
Network slicing is a key capability for next generation mobile networks. It enables infrastructure providers to cost effectively customize logical networks over a shared infrastructure. A critical component of network slicing is resource allocation, which needs to ensure that slices receive the resources needed to support their services while optimizing network efficiency. In this paper, we propose a novel approach to slice-based resource allocation named Guaranteed seRvice Efficient nETwork slicing (GREET). The underlying concept is to set up a constrained resource allocation game, where ( $i$ ) slices unilaterally optimize their allocations to best meet their (dynamic) customer loads, while ( $ii$ ) constraints are imposed to guarantee that, if they wish so, slices receive a pre-agreed share of the network resources. The resulting game is a variation of the well-known Fisher market, where slices are provided a budget to contend for network resources (as in a traditional Fisher market), but (unlike a Fisher market) prices are constrained for some resources to ensure that the pre-agreed guarantees are met for each slice. In this way, GREET combines the advantages of a share-based approach (high efficiency by flexible sharing) and reservation-based ones (which provide guarantees by assigning a fixed amount of resources). We characterize the Nash equilibrium, best response dynamics, and propose a practical slice strategy with provable convergence properties. Extensive simulations exhibit substantial improvements over network slicing state-of-the-art benchmarks.