A fix-and-optimize approach for efficient and large scale virtual network function placement and chaining

Network Function Virtualization (NFV) is a novel concept that is reshaping the middlebox arena, shifting network functions (e.g. firewall, gateways, proxies) from specialized hardware appliances to software images running on commodity hardware. This concept has potential to make network function provision and operation more flexible and cost-effective, paramount in a world where deployed middleboxes may easily reach the order of hundreds. In spite of recent research activity in the field, little has been done towards efficient and scalable placement & chaining of virtual network functions (VNFs) a key feature for the effective success of NFV. More specifically, existing strategies have either neglected the chaining aspect of NFV, focusing on efficient placement only, or failed to scale to hundreds of network functions. In this paper, we approach VNF placement and chaining as an optimization problem, and propose a fix-and-optimize-based heuristic algorithm for tackling it. Our algorithm incorporates a Variable Neighborhood Search (VNS) meta-heuristic, for efficiently exploring the placement and chaining solution space. The goal is to minimize required resource allocation, while meeting network flow requirements and constraints. We provide evidence that our algorithm is able to find feasible, high quality solutions efficiently, even in scenarios scaling to hundreds of VNFs.

[1]  Stefan Helber,et al.  A Fix-and-Optimize Approach for the Multi-Level Capacitated Lot Sizing Problems , 2010 .

[2]  Minlan Yu,et al.  Rethinking virtual network embedding: substrate support for path splitting and migration , 2008, CCRV.

[3]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[4]  Vyas Sekar,et al.  Making middleboxes someone else's problem: network processing as a cloud service , 2012, SIGCOMM '12.

[5]  Albert,et al.  Topology of evolving networks: local events and universality , 2000, Physical review letters.

[6]  Tamás Lukovszki,et al.  It's a Match!: Near-Optimal and Incremental Middlebox Deployment , 2016, CCRV.

[7]  Kate Ching-Ju Lin,et al.  Deploying chains of virtual network functions: On the relation between link and server usage , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[8]  Luciana S. Buriol,et al.  Piecing together the NFV provisioning puzzle: Efficient placement and chaining of virtual network functions , 2015, 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM).

[9]  Matthias Rost,et al.  Service Chain and Virtual Network Embeddings: Approximations using Randomized Rounding , 2016, ArXiv.

[10]  Joseph Naor,et al.  Near optimal placement of virtual network functions , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Katerina J. Argyraki,et al.  Toward Predictable Performance in Software Packet-Processing Platforms , 2012, NSDI.

[13]  Konstantina Papagiannaki,et al.  Analysis of point-to-point packet delay in an operational network , 2004, IEEE INFOCOM 2004.

[14]  Horst Tempelmeier,et al.  Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic , 2009, Comput. Oper. Res..

[15]  Aditya Akella,et al.  OpenNF: enabling innovation in network function control , 2015, SIGCOMM 2015.

[16]  Tamás Lukovszki,et al.  Online Admission Control and Embedding of Service Chains , 2015, SIROCCO.

[17]  Holger Karl,et al.  Specifying and placing chains of virtual network functions , 2014, 2014 IEEE 3rd International Conference on Cloud Networking (CloudNet).

[18]  Vittorio Maniezzo,et al.  Matheuristics: Hybridizing Metaheuristics and Mathematical Programming , 2009 .

[19]  K. K. Ramakrishnan,et al.  NetVM: High Performance and Flexible Networking Using Virtualization on Commodity Platforms , 2014, IEEE Transactions on Network and Service Management.

[20]  Yong Zhu,et al.  Algorithms for Assigning Substrate Network Resources to Virtual Network Components , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[21]  Filip De Turck,et al.  VNF-P: A model for efficient placement of virtualized network functions , 2014, 10th International Conference on Network and Service Management (CNSM) and Workshop.

[22]  Raouf Boutaba,et al.  On orchestrating virtual network functions , 2015, 2015 11th International Conference on Network and Service Management (CNSM).

[23]  Vyas Sekar,et al.  The middlebox manifesto: enabling innovation in middlebox deployment , 2011, HotNets-X.