面向高效大规模网络切片的LP动态舍入和细化方法
Towards Efficient Large-Scale Network Slicing: An LP Dynamic Rounding-and-Refinement Approach
摘要:
在本文中,我们提出了一个有效的算法,试图将多个定制的虚拟网络请求(也称为服务)映射到一个共同的共享网络基础设施,并分配网络资源,以满足不同的服务需求的网络切片问题。在文献中,该问题已被公式化为混合整数线性规划(MILP)公式。我们首先提出了一种新的线性规划(LP)松弛的MILP制定。我们表明,与自然LP松弛的MILP制定相比,新的LP松弛是更紧凑的变量和约束的数量较少,更强的提供一个更好的LP界,这使得它特别适合嵌入在LP松弛算法。然后,我们设计了一个有效的两阶段LP动态舍入和细化算法的基础上,这种新的LP松弛。在第一阶段,该算法使用LP动态舍入过程将所有业务的虚拟网络功能放置到云节点中,同时考虑所有业务的流量路由;在第二阶段,该算法使用迭代LP细化过程获得满足端到端延迟约束的所有业务的流量路由解。与已有的具有指数复杂度或返回低质量解的算法相比,该算法在解的质量和计算复杂性之间取得了更好的折衷.特别是,我们提出的算法的最坏情况下的复杂度是多项式,这使得它适合于解决大规模的问题。数值结果表明了该算法的有效性和效率。
英文摘要:
In this paper, we propose an efficient algorithm for the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and allocate network resources to meet diverse service requirements. The problem has been formulated as a mixed integer linear programming (MILP) formulation in the literature. We first propose a novel linear programming (LP) relaxation of the MILP formulation. We show that compared with a natural LP relaxation of the MILP formulation, the novel LP relaxation is much more compact in terms of smaller numbers of variables and constraints, and much stronger in terms of providing a better LP bound, which makes it particularly suitable to be embedded in an LP relaxation based algorithm. Then we design an efficient two-stage LP dynamic rounding-and-refinement algorithm based on this novel LP relaxation. In the first stage, the proposed algorithm uses an LP dynamic rounding procedure to place the virtual network functions of all services into cloud nodes while taking traffic routing of all services into consideration; in the second stage, the proposed algorithm uses an iterative LP refinement procedure to obtain a solution for traffic routing of all services with their end-to-end delay constraints being satisfied. Compared with the existing algorithms which either have an exponential complexity or return a low-quality solution, our proposed algorithm achieves a better trade-off between the solution quality and the computational complexity. In particular, the worst-case complexity of our proposed algorithm is polynomial, which makes it suitable for solving large-scale problems. Numerical results demonstrate the effectiveness and efficiency of our proposed algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。