Efficient NFV-Enabled Multicasting in SDNs

• Published in: IEEE transactions on communications Vol. 67; no. 3; pp. 2052 - 2070
• Main Authors: Xu, Zichuan, Liang, Weifa, Huang, Meitian, Jia, Mike, Guo, Song, Galis, Alex
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.03.2019; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Approximation; Approximation algorithms; Bandwidth; Chains; Computer simulation; Computing costs; Cybersecurity; Firewalls; Heuristic algorithms; Intrusion detection systems; Mathematical analysis; Multicast algorithms; Multicast communication; Multicasting; Network function virtualization; NFV-enabled multicasting; online algorithms; Packets (communication); routing; Servers; service chains; Software; software-defined networks; Transcoders; Video transmission; virtualized network functions
• ISSN: 0090-6778; 1558-0857
• DOI: 10.1109/TCOMM.2018.2881438

Multicasting is a fundamental functionality of many network applications, including online conferencing, event monitoring, video streaming, and so on. To ensure reliable, secure, and scalable multicasting, a service chain that consists of network functions (e.g., firewalls, intrusion detection systems, and transcoders) usually is associated with each multicast request. We refer to such a multicast request with service chain requirement as an network function virtualization (NFV)-enabled multicast request. In this paper, we study NFV-enabled multicasting in a software-defined network (SDN) with an aim to maximize network throughput while minimizing the implementation cost of admitted NFV-enabled multicast requests, subject to network resource capacity, where the implementation cost of a request consists of its computing resource consumption cost in servers and its network bandwidth consumption cost when routing and processing its data packets in the network. To this end, we first formulate two NFV-enabled multicasting problems with and without resource capacity constraints and one online NFV-enabled multicasting problem. We then devise two approximation algorithms with an approximation ratio of <inline-formula> <tex-math notation="LaTeX">2M </tex-math></inline-formula> for the NFV-enabled multicasting problems with and without resource capacity constraints, if the number of servers for implementing the service chain of each request is no greater than a constant <inline-formula> <tex-math notation="LaTeX">M </tex-math></inline-formula> (≥1). We also study dynamic admissions of NFV-enabled multicast requests without the knowledge of future request arrivals with the objective to maximize the network throughput, for which we propose an efficient heuristic, and for the special case of dynamic request admissions, we devise an online algorithm with a competitive ratio of <inline-formula> <tex-math notation="LaTeX">O(\log n) </tex-math></inline-formula> for it when <inline-formula> <tex-math notation="LaTeX">M=1 </tex-math></inline-formula>, where <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> is the number of nodes in the network. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are promising and outperform existing heuristics.