File Download
Supplementary

Conference Paper: Online VNF scaling in datacenters

TitleOnline VNF scaling in datacenters
Authors
Issue Date2016
PublisherIEEE Computer Society.
Citation
The 9th IEEE International Conference on Cloud Computing (IEEE CLOUD 2016), San Francisco, CA., 27 June-2 July 2016. In Conference Proceedings, 2016, p. 1-8 How to Cite?
AbstractNetwork Function Virtualization (NFV) is a promising technology that promises to significantly reduce the operational costs of network services by deploying virtualized network functions (VNFs) to commodity servers in place of dedicated hardware middleboxes. The VNFs are typically running on virtual machine instances in a cloud infrastructure, where the virtualization technology enables dynamic provisioning of VNF instances, to process the fluctuating traffic that needs to go through the network functions in a network service. In this paper, we target dynamic provisioning of enterprise network services - expressed as one or multiple service chains - in cloud datacenters, and design efficient online algorithms without requiring any information on future traffic rates. The key is to decide the number of instances of each VNF type to provision at each time, taking into consideration the server resource capacities and traffic rates between adjacent VNFs in a service chain. In the case of a single service chain, we discover an elegant structure of the problem and design an efficient randomized algorithm achieving a e/(e-1) competitive ratio. For multiple concurrent service chains, an online heuristic algorithm is proposed, which is O(1)- competitive. We demonstrate the effectiveness of our algorithms using solid theoretical analysis and trace-driven simulations.
Persistent Identifierhttp://hdl.handle.net/10722/230545

 

DC FieldValueLanguage
dc.contributor.authorWang, X-
dc.contributor.authorWu, C-
dc.contributor.authorLe, F-
dc.contributor.authorLiu, A-
dc.contributor.authorLi, Z-
dc.contributor.authorLau, FCM-
dc.date.accessioned2016-08-23T14:17:39Z-
dc.date.available2016-08-23T14:17:39Z-
dc.date.issued2016-
dc.identifier.citationThe 9th IEEE International Conference on Cloud Computing (IEEE CLOUD 2016), San Francisco, CA., 27 June-2 July 2016. In Conference Proceedings, 2016, p. 1-8-
dc.identifier.urihttp://hdl.handle.net/10722/230545-
dc.description.abstractNetwork Function Virtualization (NFV) is a promising technology that promises to significantly reduce the operational costs of network services by deploying virtualized network functions (VNFs) to commodity servers in place of dedicated hardware middleboxes. The VNFs are typically running on virtual machine instances in a cloud infrastructure, where the virtualization technology enables dynamic provisioning of VNF instances, to process the fluctuating traffic that needs to go through the network functions in a network service. In this paper, we target dynamic provisioning of enterprise network services - expressed as one or multiple service chains - in cloud datacenters, and design efficient online algorithms without requiring any information on future traffic rates. The key is to decide the number of instances of each VNF type to provision at each time, taking into consideration the server resource capacities and traffic rates between adjacent VNFs in a service chain. In the case of a single service chain, we discover an elegant structure of the problem and design an efficient randomized algorithm achieving a e/(e-1) competitive ratio. For multiple concurrent service chains, an online heuristic algorithm is proposed, which is O(1)- competitive. We demonstrate the effectiveness of our algorithms using solid theoretical analysis and trace-driven simulations.-
dc.languageeng-
dc.publisherIEEE Computer Society.-
dc.relation.ispartofIEEE International Conference on Cloud Computing (CLOUD) Proceedings-
dc.rightsIEEE International Conference on Cloud Computing (CLOUD) Proceedings. Copyright © IEEE Computer Society.-
dc.rights©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleOnline VNF scaling in datacenters-
dc.typeConference_Paper-
dc.identifier.emailWu, C: cwu@cs.hku.hk-
dc.identifier.emailLau, FCM: fcmlau@cs.hku.hk-
dc.identifier.authorityWu, C=rp01397-
dc.identifier.authorityLau, FCM=rp00221-
dc.description.naturepostprint-
dc.identifier.hkuros261733-
dc.identifier.spage1-
dc.identifier.epage8-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 160908-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats