In this paper, we consider 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, and propose an efficient two-stage algorithm for solving this NP-hard problem. In the first stage, the proposed algorithm uses an iterative linear programming (LP) 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 solution quality and 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.

翻译：在本文中,我们考虑了试图将多个定制虚拟网络请求(也称为服务)映射成一个共同共享的网络基础设施(也称为服务)和分配网络资源以满足各种服务要求的网络切片问题,并提出了解决这一NP硬性问题的高效的两阶段算法。 在第一阶段,拟议算法使用迭代线性编程(LP)四舍五入程序将所有服务的虚拟网络功能置于云节点中,同时考虑到所有服务的交通路线;在第二阶段,拟议算法使用迭接式LP精细化程序,以获得所有服务的交通路线的解决方案,其终端到终端的延迟限制正在得到满足。与现有的具有指数复杂性或返回低质量解决方案的算法相比,我们拟议的算法在解决方案质量和计算复杂性之间实现了更好的交易。特别是,我们拟议算法的最坏的复杂程度是多数值,因此适合解决大规模问题。数字结果表明我们拟议算法的有效性和效率。