Xu, Z;
Liang, W;
Huang, M;
Jia, M;
Guo, S;
Galis, A;
(2017)
Approximation and Online Algorithms for NFV-Enabled Multicasting in SDNs.
In: Lee, K and Liu, L, (eds.)
Proceedings of the 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS).
(pp. pp. 625-634).
IEEE: Atlanta, GA, USA.
Preview |
Text
Galis_ICDCS_2017_paper_272.pdf - Accepted Version Download (510kB) | Preview |
Abstract
Multicasting is a fundamental functionality of networks for many applications including online conferencing, event monitoring, video streaming, and system monitoring in data centers. To ensure multicasting reliable, secure and scalable, a service chain consisting of network functions (e.g., firewalls, Intrusion Detection Systems (IDSs), and transcoders) usually is associated with each multicast request. Such a multicast request is referred to as an NFV-enabled multicast request. In this paper we study NFV-enabled multicasting in a Software-Defined Network (SDN) with the aims to minimize the implementation cost of each NFV-enabled multicast request or maximize the network throughput for a sequence of NFV-enabled requests, subject to network resource capacity constraints. We first formulate novel NFV-enabled multicasting and online NFV-enabled multicasting problems. We then devise the very first approximation algorithm with an approximation ratio of 2K for the NFV-enabled multicasting problem if the number of servers for implementing the network functions of each request is no more than a constant K (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 online algorithm with a competitive ratio of O(log n) when K = 1, where n 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 outperform other existing heuristics.
| Type: | Proceedings paper |
|---|---|
| Title: | Approximation and Online Algorithms for NFV-Enabled Multicasting in SDNs |
| Event: | 37th IEEE International Conference on Distributed Computing Systems (ICDCS) |
| Location: | Atlanta, GA |
| Dates: | 05 June 2017 - 08 June 2017 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1109/ICDCS.2017.43 |
| Publisher version: | http://doi.org/10.1109/ICDCS.2017.43 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| Keywords: | Network function virtualization, software-defined networks, multicasting, NFV-enabled multicasting, service chains, virtualized network functions, approximation and online algorithms |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Electronic and Electrical Eng |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10051376 |
Archive Staff Only
 |
View Item |
