论文标题
在启用NFV的核心网络中用于多播服务的虚拟网络自定义框架
A Virtual Network Customization Framework for Multicast Services in NFV-enabled Core Networks
论文作者
论文摘要
在软件定义的网络(SDN)支持下,网络功能虚拟化(NFV)的范式是一种有希望的方法,用于定制第五代网络(5G)网络的网络服务。在本文中,提出了一个多播服务编排框架,其中研究了联合流量路由和虚拟网络功能(NF)放置,以通过启用NFV的物理基板网络来容纳多播服务。首先,我们研究了通过物理基板网络适应的单个多播请求的联合路由和NF放置问题,并具有单路径和多路径流量路由。在物理网络资源约束,流节保护约束和NF放置规则下,联合问题被称为混合整数线性编程(MILP)问题,以最大程度地降低功能和链接配置成本;其次,我们开发了一种MILP配方,该配方可以共同处理物理基板网络上多个服务请求的静态嵌入,在该网络中,我们确定多种服务的最佳组合及其嵌入及其联合路由和放置配置,从而最大程度地提高了物理基板的聚合吞吐量,而功能和链接成本则最大化。由于提出的问题制剂是NP - hard,因此提出了低复杂性启发式算法以找到有效的单路径和多路径路由方案的解决方案。提出了仿真结果,以证明所提出的启发式算法的有效性和准确性。
The paradigm of network function virtualization (NFV) with the support of software defined networking (SDN) emerges as a promising approach for customizing network services in fifth generation (5G) networks. In this paper, a multicast service orchestration framework is presented, where joint traffic routing and virtual network function (NF) placement are studied for accommodating multicast services over an NFV-enabled physical substrate network. First, we investigate a joint routing and NF placement problem for a single multicast request accommodated over a physical substrate network, with both single-path and multipath traffic routing. The joint problem is formulated as a mixed integer linear programming (MILP) problem to minimize the function and link provisioning costs, under the physical network resource constraints, flow conservation constraints, and NF placement rules; Second, we develop an MILP formulation that jointly handles the static embedding of multiple service requests over the physical substrate network, where we determine the optimal combination of multiple services for embedding and their joint routing and placement configurations, such that the aggregate throughput of the physical substrate is maximized, while the function and link provisioning costs are minimized. Since the presented problem formulations are NP-hard, low complexity heuristic algorithms are proposed to find an efficient solution for both single-path and multipath routing scenarios. Simulation results are presented to demonstrate the effectiveness and accuracy of the proposed heuristic algorithms.