Orchestrating Virtualized Network Functions

被引:333
作者
Bari, Md. Faizul [1 ]
Chowdhury, Shihabur Rahman [1 ]
Ahmed, Reaz [1 ]
Boutaba, Raouf [1 ]
Muniz Bandeira Duarte, Otto Carlos [2 ]
机构
[1] Univ Waterloo, David R Cheriton Sch Comp Sci, Waterloo, ON N2L 3G1, Canada
[2] Univ Fed Rio de Janeiro, Grp Teleinformat & Automacao, BR-21945970 Rio De Janeiro, Brazil
来源
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT | 2016年 / 13卷 / 04期
基金
加拿大自然科学与工程研究理事会;
关键词
Optimization techniques; service function chaining; network function virtualization; NFV orchestration;
D O I
10.1109/TNSM.2016.2569020
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Middleboxes or network appliances like firewalls, proxies, and WAN optimizers have become an integral part of today's ISP and enterprise networks. Middlebox functionalities are usually deployed on expensive and proprietary hardware that require trained personnel for deployment and maintenance. Middleboxes contribute significantly to a network's capital and operation costs. In addition, organizations often require their traffic to pass through a specific sequence of middleboxes for compliance with security and performance policies. This makes the middlebox deployment and maintenance tasks even more complicated. Network function virtualization (NFV) is an emerging and promising technology that is envisioned to overcome these challenges. It proposes to move packet processing from dedicated hardware middleboxes to software running on commodity servers. In NFV terminology, software middleboxes are referred to as virtualized network functions (VNFs). It is a challenging problem to determine the required number and placement of VNFs that optimizes network operational costs and utilization, without violating service level agreements. We call this the VNF orchestration problem (VNF-OP) and provide an integer linear programming formulation with implementation in CPLEX. We also provide a dynamic programming-based heuristic to solve larger instances of VNF-OP. Trace driven simulations on real-world network topologies demonstrate that the heuristic can provide solutions that are within 1.3 times of the optimal solution. Our experiments suggest that a VNF-based approach can provide more than 4x reduction in the operational cost of a network.
引用
收藏
页码:725 / 739
页数:15
相关论文
共 34 条
[21]  
Martins J., 2014, Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation, P459
[22]  
Mehraghdam S, 2014, IEEE INT CONF CL NET, P7, DOI 10.1109/CloudNet.2014.6968961
[23]   Network Function Virtualization: State-of-the-Art and Research Challenges [J].
Mijumbi, Rashid ;
Serrat, Joan ;
Gorricho, Juan-Luis ;
Bouten, Niels ;
De Turck, Filip ;
Boutaba, Raouf .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2016, 18 (01) :236-262
[24]   The problem of synthetically generating IP traffic matrices: Initial recommendations [J].
Nucci, A ;
Sridharan, A ;
Taft, N .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2005, 35 (03) :19-31
[25]   SIMPLE-fying Middlebox Policy Enforcement Using SDN [J].
Qazi, Zafar Ayyub ;
Miao, Rui ;
Tu, Cheng-Chun ;
Sekar, Vyas ;
Chiang, Luis ;
Yu, Minlan .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2013, 43 (04) :27-38
[26]  
Quinn P., 2014, Active Internet-Draft, IETF Secretariat, Internet-Draft draft-ietf- sfcproblemstatement-05, 2014
[27]  
Rankothge W, 2015, PROCEEDINGS OF THE 2015 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM), P89, DOI 10.1109/INM.2015.7140280
[28]  
Saino L., 2013, P 6 INT ICST C SIM T, V13, P82
[29]  
Sekar V, 2012, P 9 USENIX S NETW SY, P323
[30]  
Sekar V., 2011, P 10 ACM WORKSH HOT, P1