UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Throughput optimization for admitting NFV-enabled requests in cloud networks

Xu, Z; Liang, W; Galis, A; Ma, Y; Xia, Q; Xu, W; (2018) Throughput optimization for admitting NFV-enabled requests in cloud networks. Computer Networks , 143 pp. 15-29. 10.1016/j.comnet.2018.06.015. (In press). Green open access

[img]
Preview
Text
nfv_service_comnet_final.pdf - ["content_typename_Published version" not defined]

Download (1MB) | Preview

Abstract

Network softwarization is emerging as a techno-economic transformation trend that impacts the way that network service providers deliver their network services significantly. As a key ingredient of such a trend, network function virtualization (NFV) is shown to enable elastic and inexpensive network services for next-generation networks, through deploying flexible virtualized network functions (VNFs) running in virtual computing platforms. Different VNFs can be chained together to form different service chains for different network services, to meet various user data routing demands. From the service provider point of view, such services are usually implemented by VNF instances in a cloudlet network consisting of a set of data centers and switches. In this paper we consider provisioning network services in a cloud network for implementing VNF instances of service chains, where the VNF instances in each data center are partitioned into K types with each hosting one type of service chain. We investigate 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 instantiated in data centers. We first show the problem is NP-Complete, and propose an optimal algorithm for a special case of the problem when all requests have identical packet rates; otherwise, we devise two approximation algorithms with approximation ratios, depending on whether the packet traffic of each request is splittable. If arrivals of future requests are not known in advance, we study the online throughput maximization problem by proposing an online algorithm with a competitive ratio. We finally conduct experiments to evaluate the performance of the proposed algorithms by simulations. Simulation results show that the performance of the proposed algorithms are promising.

Type: Article
Title: Throughput optimization for admitting NFV-enabled requests in cloud networks
Open access status: An open access version is available from UCL Discovery
DOI: 10.1016/j.comnet.2018.06.015
Publisher version: http://dx.doi.org/10.1016/j.comnet.2018.06.015
Language: English
Additional information: © 2018 Elsevier B.V. This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
Keywords: Throughput maximization; cost minimization; approximation algorithms; online algorithms; network function virtualization; algorithm analysis.
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/10052905
Downloads since deposit
14Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item