Joint NFV placement and routing for multicast service on SDN

Network function visualization (NFV) has emerged as a promising paradigm in networking, where the hardware-based middleboxes are replaced with software-based virtualized entities typically running on the cloud to provide specific functionalities. By deploying NFV, network services become more adaptive and cost-effective. Many multicast services such as real-time multimedia streaming and intrusion detection require appropriate services chaining; however, NFVs placement in the network as well as traffic routing strategy to guarantee that the multicast flows traverse through the services chain before reaching the end user is still an open problem. In this paper, we present an algorithm to solve this problem.

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

[2]  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).

[3]  Mathieu Bouet,et al.  Cost-based placement of vDPI functions in NFV infrastructures , 2015, Proceedings of the 2015 1st IEEE Conference on Network Softwarization (NetSoft).

[4]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[5]  Heng Wang,et al.  An Efficient Algorithm Based on Simulated Annealing for Multicast Routing with Delay and Delay Variation Constraints , 2005, International Conference on Advanced Information Networking and Applications.

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

[7]  Fabrizio Grandoni,et al.  An improved LP-based approximation for steiner tree , 2010, STOC '10.

[8]  Alberto Leon-Garcia,et al.  Network Function Virtualization enabled multicast routing on SDN , 2015, 2015 IEEE International Conference on Communications (ICC).

[9]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[10]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

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

[12]  Minghua Chen,et al.  Markov Approximation for Combinatorial Network Optimization , 2013, IEEE Transactions on Information Theory.

[13]  Douglas S. Reeves,et al.  The delay-constrained minimum spanning tree problem , 1997, Proceedings Second IEEE Symposium on Computer and Communications.

[14]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[15]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

[16]  Zhang Kun,et al.  An efficient algorithm based on simulated annealing for multicast routing with delay and delay variation constraints , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

[17]  Aditya Akella,et al.  OpenNF , 2014, SIGCOMM.

[18]  Meral Shirazipour,et al.  StEERING: A software-defined networking for inline service chaining , 2013, 2013 21st IEEE International Conference on Network Protocols (ICNP).

[19]  Antonio Capone,et al.  Stochastic Planning for Content Delivery: Unveiling the Benefits of Network Functions Virtualization , 2014, 2014 IEEE 22nd International Conference on Network Protocols.