SDN-Based Traffic Aware Placement of NFV Middleboxes

Network function virtualization (NFV) enables flexible deployment of middleboxes as virtual machines running on general hardware. Since different middleboxes may change the volume of processed traffic in different ways, improper deployment of NFV middleboxes will result in hot spots and congestion. In this paper, we study the traffic changing effects of middleboxes, and propose software-defined networking based middlebox placement solutions to achieve optimal load balancing. We formulate the traffic aware middlebox placement (TAMP) problem as a graph optimization problem with the objective to minimize the maximum link load ratio. First, we solve the TAMP problem when the flow paths are predetermined, such as the case in a tree. For a single flow, we propose the least-first-greatest-last (LFGL) rule and prove its optimality; for multiple flows, we first show the NP-hardness of the problem, and then propose an efficient heuristic. Next, for the general TAMP problem without predetermined flow paths, we prove that it is NP-hard even for a single flow, and propose the LFGL based MinMax routing algorithm by integrating LFGL with MinMax routing. We use a joint emulation and simulation approach to evaluate the proposed solutions, and present extensive experimental and simulation results to demonstrate the effectiveness of our design.

[1]  K. K. Ramakrishnan,et al.  Toward a software-based network: integrating software defined networking and network function virtualization , 2015, IEEE Network.

[2]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[3]  Haitao Wu,et al.  ServerSwitch: A Programmable and High Performance Platform for Data Center Networks , 2011, NSDI.

[4]  Jinwei Xia,et al.  Uniform handling and abstraction of NFV hardware accelerators , 2015, IEEE Network.

[5]  Seungjoon Lee,et al.  Network function virtualization: Challenges and opportunities for innovations , 2015, IEEE Communications Magazine.

[6]  J. Rexford,et al.  Rule-Caching Algorithms for Software-Defined Networks , 2014 .

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[8]  Praveen Yalagandula,et al.  Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection , 2011, 2011 Proceedings IEEE INFOCOM.

[9]  Lisandro Zambenedetti Granville,et al.  Data Center Network Virtualization: A Survey , 2013, IEEE Communications Surveys & Tutorials.

[10]  KyoungSoo Park,et al.  PacketShader: Massively Parallel Packet Processing with GPUs to Accelerate Software Routers , 2010, NSDI 2010.

[11]  Guillaume Urvoy-Keller,et al.  Too Many SDN Rules? Compress Them with MINNIE , 2014, GLOBECOM 2014.

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms, 3rd Edition , 2009 .

[13]  Sujata Banerjee,et al.  ElasticTree: Saving Energy in Data Center Networks , 2010, NSDI.

[14]  Amin Vahdat,et al.  xOMB: Extensible Open MiddleBoxes with commodity servers , 2012, 2012 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[15]  Guy Leduc,et al.  How Well Do Traffic Engineering Objective Functions Meet TE Requirements? , 2006, Networking.

[16]  Frédéric Giroire,et al.  Compressing Two-dimensional Routing Tables with Order , 2016, Electron. Notes Discret. Math..

[17]  Frédéric Giroire,et al.  Minimization of Network Power Consumption with Redundancy Elimination , 2012, Networking.

[18]  Bobby Bhattacharjee,et al.  Triangle inequality variations in the internet , 2009, IMC '09.

[19]  Mark Handley,et al.  Towards high performance virtual routers on commodity hardware , 2008, CoNEXT '08.

[20]  Raj Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[21]  Paul Francis,et al.  SMALTA: practical and near-optimal FIB aggregation , 2011, CoNEXT '11.

[22]  Mohit Singh,et al.  Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs , 2007, APPROX-RANDOM.

[23]  Minlan Yu,et al.  FlowTags: enforcing network-wide policies in the presence of dynamic middlebox actions , 2013, HotSDN '13.

[24]  Minlan Yu,et al.  SIMPLE-fying middlebox policy enforcement using SDN , 2013, SIGCOMM.

[25]  Filip De Turck,et al.  Network Function Virtualization: State-of-the-Art and Research Challenges , 2015, IEEE Communications Surveys & Tutorials.

[26]  Vera Stavroulaki,et al.  5G on the Horizon: Key Challenges for the Radio-Access Network , 2013, IEEE Vehicular Technology Magazine.

[27]  Roberto Bifulco,et al.  ClickOS and the Art of Network Function Virtualization , 2014, NSDI.

[28]  David Coudert,et al.  Robust energy-aware routing with redundancy elimination , 2015, Comput. Oper. Res..

[29]  Xin Zhao,et al.  On the Aggregatability of Router Forwarding Tables , 2010, 2010 Proceedings IEEE INFOCOM.

[30]  Vyas Sekar,et al.  Design and Implementation of a Consolidated Middlebox Architecture , 2012, NSDI.

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

[32]  EDDIE KOHLER,et al.  The click modular router , 2000, TOCS.

[33]  David Walker,et al.  Optimizing the "one big switch" abstraction in software-defined networks , 2013, CoNEXT.

[34]  Shigeki Goto,et al.  Identifying elephant flows through periodically sampled packets , 2004, IMC '04.