UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Throughput Maximization and Resource Optimization in NFV-Enabled Networks

Xu, Z; Liang, W; Galis, A; Ma, Y; (2017) Throughput Maximization and Resource Optimization in NFV-Enabled Networks. In: Gesbert, D and Debbah, M and Mellouk, A, (eds.) Proceedings of the 2017 IEEE International Conference on Communications (ICC). IEEE: Paris, France. Green open access

[img]
Preview
Text
Galis_nfvservice.pdf - ["content_typename_Accepted version" not defined]

Download (549kB) | Preview

Abstract

Network function virtualization (NFV) has been emerging as a new paradigm to enable elastic and inexpensive network services in modern computer networks, through deploying flexible virtualized network functions (VNFs) running in virtual computing platforms. Different VNFs can be chained together to form different service chains, to meet various user data routing demands for different network services. In this paper we consider provisioning network services in an NFV-enabled network that consists of data centers for implementing VNF instances of service chains and switches. We study the throughput maximization problem with the aim to admit as many user requests as possible while minimizing the implementation cost of the requests, assuming that limited numbers of instances of each service chain have been stored in data centers. We first propose an optimal algorithm for the problem if all requests have identical packet rates; otherwise, we devise two approximation algorithms with probable approximation ratios, depending on whether the packet traffic of each request is splittable. We finally conduct experiments to evaluate the performance of the proposed algorithms by simulations. Experimental results show that the proposed algorithms achieve at least 15% more throughput than that of a greedy algorithm.

Type: Proceedings paper
Title: Throughput Maximization and Resource Optimization in NFV-Enabled Networks
Event: IEEE International Conference on Communications (ICC)
Location: Paris, FRANCE
Dates: 21 May 2017 - 25 May 2017
Open access status: An open access version is available from UCL Discovery
DOI: 10.1109/ICC.2017.7996514
Publisher version: http://doi.org/10.1109/ICC.2017.7996514
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
Keywords: Delays, Throughput, Approximation algorithms, Virtualization, Routing, Cloud computing, Virtual machining
UCL classification: UCL > Provost and Vice Provost Offices
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: http://discovery.ucl.ac.uk/id/eprint/10051375
Downloads since deposit
63Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item