NFV-Enabled Multicasting in Mobile Edge Clouds with Resource Sharing

Driven by stringent delay requirements of mobile applications, the mobile edge cloud has emerged as a major platform to offer low latency network services from the edge of networks. Most conventional network services are implemented via hardware-based network functions, such as firewalls and load balancers, to guarantee service security and performance. However, implementing such hardware-based network functions incurs high purchase and maintenance costs. Network function virtualization (NFV) as a promising technology exhibits great potential to reduce the purchase and maintenance costs by implementing network functions as software in virtual machines (VMs). In this paper, we consider a fundamental problem of NFV-enabled multicasting in a mobile edge cloud, where each multicast request requires to process its traffic in a specified sequence of network functions (referred to as a service chain) before the traffic from a source to a set of destinations. We devise a provable approximation algorithm with an approximation ratio for the problem if requests do not have delay requirements; otherwise, we propose an efficient heuristic for it. We also evaluate the performance of the proposed algorithms against the state-of-the-art NFV-enabled multicasting algorithms, and results show that our algorithms outperform their counterparts.

[1]  Weifa Liang,et al.  Dynamic routing for network throughput maximization in software-defined networks , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[2]  Stuart Clayman,et al.  A service-aware virtualized software-defined infrastructure , 2015, IEEE Communications Magazine.

[3]  Walid Dabbous,et al.  NFV-Based Scalable Guaranteed-Bandwidth Multicast Service for Software Defined ISP Networks , 2017, IEEE Transactions on Network and Service Management.

[4]  Sudipto Guha,et al.  Approximation algorithms for directed Steiner problems , 1999, SODA '98.

[5]  Chih-Chung Lin,et al.  Scalable Steiner Tree for Multicast Communications in Software-Defined Networking , 2014, ArXiv.

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

[7]  Weifa Liang,et al.  Throughput maximization and resource optimization in NFV-enabled networks , 2017, 2017 IEEE International Conference on Communications (ICC).

[8]  Huawei Huang,et al.  Traffic scheduling for deep packet inspection in software‐defined networks , 2017, Concurr. Comput. Pract. Exp..

[9]  Weifa Liang,et al.  Approximation and Online Algorithms for NFV-Enabled Multicasting in SDNs , 2017, 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS).

[10]  Nick Cammorato Software-Defined Infrastructure , 2014 .

[11]  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.

[12]  Ao Tang,et al.  Scalable Routing in SDN-enabled Networks with Consolidated Middleboxes , 2015, HotMiddlebox@SIGCOMM.

[13]  Jinsong Wu,et al.  Service Chaining for Hybrid Network Function , 2019, IEEE Transactions on Cloud Computing.

[14]  Jie Wu,et al.  NFV Middlebox Placement with Balanced Set-up Cost and Bandwidth Consumption , 2018, ICPP.

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

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

[17]  Bo Zong,et al.  Efficient multicasting for delay tolerant networks using graph indexing , 2012, 2012 Proceedings IEEE INFOCOM.

[18]  Weifa Liang,et al.  Profit Maximization for Admitting Requests with Network Function Services in Distributed Clouds , 2019, IEEE Transactions on Parallel and Distributed Systems.

[19]  Matthew Roughan,et al.  The Internet Topology Zoo , 2011, IEEE Journal on Selected Areas in Communications.

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

[21]  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.

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

[23]  Weifa Liang,et al.  Efficient NFV-Enabled Multicasting in SDNs , 2019, IEEE Transactions on Communications.

[24]  Sridhar Radhakrishnan,et al.  Multicast Routing with Delay and Delay Variation Constraints for Collaborative Applications on Overlay Networks , 2007, IEEE Transactions on Parallel and Distributed Systems.

[25]  Guoming Tang,et al.  Optimal Service Function Tree Embedding for NFV Enabled Multicast , 2018, 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS).

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

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

[28]  Danny Raz,et al.  A simple efficient approximation scheme for the restricted shortest path problem , 2001, Oper. Res. Lett..

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

[30]  Yang Li,et al.  Network functions virtualization with soft real-time guarantees , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.