File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Online Scaling of NFV Service Chains across Geo-distributed Datacenters

TitleOnline Scaling of NFV Service Chains across Geo-distributed Datacenters
Authors
KeywordsConvex optimization
Network function virtualization
Online algorithm
Service chains
Issue Date2018
PublisherInstitute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=90
Citation
IEEE/ACM Transactions on Networking, 2018, v. 26 n. 2, p. 699-710 How to Cite?
AbstractNetwork Function Virtualization (NFV) is an emerging paradigm that turns hardware-dependent implementation of network functions (i.e., middleboxes) into software modules running on virtualized platforms, for significant cost reduction and ease of management. Such virtual network functions (VNFs) commonly constitute service chains, to provide network services that traffic flows need to go through. Efficient deployment of VNFs for network service provisioning is a key to realize the NFV goals. Existing efforts on VNF placement mostly deal with offline or one-time placement, ignoring the fundamental, dynamic deployment and scaling need of VNFs to handle practical time-varying traffic volumes. This work investigates dynamic placement of VNF service chains across geo-distributed datacenters to serve flows between dispersed source and destination pairs, for operational cost minimization of the service chain provider over the entire system span. An efficient online algorithm is proposed, which consists of two main components: 1) A regularization-based approach from online learning literature to convert the offline optimal deployment problem into a sequence of one-shot regularized problems, each to be efficiently solved in one time slot and 2) An online dependent rounding scheme to derive feasible integer solutions from the optimal fractional solutions of the one-shot problems, and to guarantee a good competitive ratio of the online algorithm over the entire time span. We verify our online algorithm with solid theoretical analysis and trace-driven simulations under realistic settings.
Persistent Identifierhttp://hdl.handle.net/10722/259904
ISSN
2017 Impact Factor: 3.11
2015 SCImago Journal Rankings: 1.795
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorJia, Y-
dc.contributor.authorWu, C-
dc.contributor.authorLi, Z-
dc.contributor.authorLe, FCM-
dc.contributor.authorLiu, A-
dc.date.accessioned2018-09-03T04:16:06Z-
dc.date.available2018-09-03T04:16:06Z-
dc.date.issued2018-
dc.identifier.citationIEEE/ACM Transactions on Networking, 2018, v. 26 n. 2, p. 699-710-
dc.identifier.issn1063-6692-
dc.identifier.urihttp://hdl.handle.net/10722/259904-
dc.description.abstractNetwork Function Virtualization (NFV) is an emerging paradigm that turns hardware-dependent implementation of network functions (i.e., middleboxes) into software modules running on virtualized platforms, for significant cost reduction and ease of management. Such virtual network functions (VNFs) commonly constitute service chains, to provide network services that traffic flows need to go through. Efficient deployment of VNFs for network service provisioning is a key to realize the NFV goals. Existing efforts on VNF placement mostly deal with offline or one-time placement, ignoring the fundamental, dynamic deployment and scaling need of VNFs to handle practical time-varying traffic volumes. This work investigates dynamic placement of VNF service chains across geo-distributed datacenters to serve flows between dispersed source and destination pairs, for operational cost minimization of the service chain provider over the entire system span. An efficient online algorithm is proposed, which consists of two main components: 1) A regularization-based approach from online learning literature to convert the offline optimal deployment problem into a sequence of one-shot regularized problems, each to be efficiently solved in one time slot and 2) An online dependent rounding scheme to derive feasible integer solutions from the optimal fractional solutions of the one-shot problems, and to guarantee a good competitive ratio of the online algorithm over the entire time span. We verify our online algorithm with solid theoretical analysis and trace-driven simulations under realistic settings.-
dc.languageeng-
dc.publisherInstitute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=90-
dc.relation.ispartofIEEE/ACM Transactions on Networking-
dc.rightsIEEE/ACM Transactions on Networking. Copyright © Institute of Electrical and Electronics Engineers.-
dc.subjectConvex optimization-
dc.subjectNetwork function virtualization-
dc.subjectOnline algorithm-
dc.subjectService chains-
dc.titleOnline Scaling of NFV Service Chains across Geo-distributed Datacenters-
dc.typeArticle-
dc.identifier.emailWu, C: cwu@cs.hku.hk-
dc.identifier.authorityWu, C=rp01397-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TNET.2018.2800400-
dc.identifier.scopuseid_2-s2.0-85042173218-
dc.identifier.hkuros288746-
dc.identifier.volume26-
dc.identifier.issue2-
dc.identifier.spage699-
dc.identifier.epage710-
dc.identifier.isiWOS:000430596000004-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats