论文标题
启用NFV服务的强大在线组成，路由和NF放置
Robust Online Composition, Routing and NF Placement for NFV-enabled Services
论文作者
论文摘要
网络功能虚拟化（NFV）促进了网络领域中的创新，并降低了管理现代传统网络所涉及的复杂性。通过NFV，网络服务的配置变得更加敏捷，可以在商品服务器和数据中心按需实例化虚拟网络功能。网络功能可以是强制性的，也可以是最好的。对于网络服务的正确性，前者类型是必需的，而后者则是可选择的，但不需要。在本文中，我们研究了支持NFV的网络服务的在线供应。我们考虑具有多个强制性和最佳效果NF实例的Unicast和多播NFV服务。我们提出了一种基于基于双偶的在线近似算法，该算法同时分配处理和传输资源以最大化利润功能，但受到物理链接和NFV节点的资源约束。在线算法类似于联合入学机制以及在线组成，路由和NF安置框架。在线算法是通过基于基于偶的分析的离线配方得出的。这样的分析提供了直接见解和对具有多种资源类型的NFV服务的利润最大化问题的性质的基本理解。
Network function virtualization (NFV) fosters innovation in the networking field and reduces the complexity involved in managing modern-day conventional networks. Via NFV, the provisioning of a network service becomes more agile, whereby virtual network functions can be instantiated on commodity servers and data centers on demand. Network functions can be either mandatory or best-effort. The former type is strictly necessary for the correctness of a network service, whereas the latter is preferrable yet not necessary. In this paper, we study the online provisioning of NFV-enabled network services. We consider both unicast and multicast NFV-enabled services with multiple mandatory and best-effort NF instances. We propose a primal-dual based online approximation algorithm that allocates both processing and transmission resources to maximize a profit function, subject to resource constraints on physical links and NFV nodes. The online algorithm resembles a joint admission mechanism and an online composition, routing and NF placement framework. The online algorithm is derived from an offline formulation through a primal-dual based analysis. Such analysis offers direct insights and a fundamental understanding on the nature of the profit-maximization problem for NFV-enabled services with multiple resource types.
