Routing Cost Minimization and Throughput Maximization of NFV-Enabled Unicasting in Software-Defined Networks

作     者：Jia, Mike Liang, Weifa Huang, Meitain Xu, Zichuan Ma, Yu 

作者机构：Australian Natl Univ Res Sch Comp Sci Canberra ACT 2601 Australia Dalian Univ Technol Sch Software Dalian 116024 Peoples R China 

出 版 物：《IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT》 (IEEE网络与服务管理汇刊)

年 卷 期：2018年第15卷第2期

页      面：732-745页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Policy-aware unicasting operational cost minimization online algorithms service chains software defined networks network function virtualization algorithm design and analysis 

摘      要：Data transfer in contemporary networks usually is associated with strict policy enforcement for data transfer security and system performance purposes. Such a policy is represented by a service chain consisting of a sequence of network functions such as firewalls, intrusion detection systems, transcoders, etc. Due to the high cost and inflexibility of managing hardware-based network functions, network function virtualization (NFV) has emerged as a promising technology to meet the stringent requirement imposed on the service chain of each data transfer request in a low-cost and flexible way. In this paper, we study policy-aware unicast request admissions with and without end-to-end delay constraints in a software defined network. We aim to minimize the operational cost of admitting a single request in terms of both computing resource consumption for implementing the NFVs in the service chain and bandwidth resource consumption for routing its data traffic, or maximize the network throughput for a sequence of requests without the knowledge of future request arrivals. We first formulate four novel optimization problems and provide a generic optimization framework for the problems. We then develop efficient algorithms for the admission of a single NFV-enabled request with and without the end-to-end delay constraint, where NFV-enabled requests are defined as the requests with policy enforcement requirements. We also devise online algorithms with a guaranteed performance for dynamic admissions of requests without the knowledge of future arrivals. In particular, we provide the very first online algorithm with a provable competitive ratio for the problem without the end-to-end delay requirement. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results show that the proposed algorithms are promising and outperform existing heuristics.