Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A fast robust optimization-based heuristic for the deployment of green virtual network functions
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.ORCID iD: 0000-0001-8802-504X
Universitat Politècnica de Catalunya, Barcelona, Spain.
Sorbonne Universités, Université de Technologie de Compiègne, France.
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science. (Computer Networking, DISCO)ORCID iD: 0000-0002-9446-8143
2017 (English)In: Journal of Network and Computer Applications, ISSN 1084-8045, E-ISSN 1095-8592, Vol. 95, 45-53 p.Article in journal (Refereed) Published
Abstract [en]

Network Function Virtualization (NFV) has attracted a lot of attention in the telecommunication field because it allows to virtualize core-business network functions on top of a NFV Infrastructure. Typically, virtual network functions (VNFs) can be represented as chains of Virtual Machines (VMs) or containers that exchange network traffic which are deployed inside datacenters on commodity hardware. In order to achieve cost efficiency, network operators aim at minimizing the power consumption of their NFV infrastructure. This can be achieved by using the minimum set of physical servers and networking equipment that are able to provide the quality of service required by the virtual functions in terms of computing, memory, disk and network related parameters. However, it is very difficult to predict precisely the resource demands required by the VNFs to execute their tasks. In this work, we apply the theory of robust optimization to deal with such parameter uncertainty. We model the problem of robust VNF placement and network embedding under resource demand uncertainty and network latency constraints using robust mixed integer optimization techniques. For online optimization, we develop fast solution heuristics. By using the virtualized Evolved Packet Core as use case, we perform a comprehensive evaluation in terms of performance, solution time and complexity and show that our heuristic can calculate robust solutions for large instances under one second.

Place, publisher, year, edition, pages
Elsevier, 2017. Vol. 95, 45-53 p.
Keyword [en]
Network Function Virtualization (NFV), Robust optimization (RO), VNF, 5G, VNF placement heuristic, Datacenter
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-64571DOI: 10.1016/j.jnca.2017.07.014OAI: oai:DiVA.org:kau-64571DiVA: diva2:1154011
Projects
HITS,
Funder
Knowledge Foundation
Available from: 2017-11-01 Created: 2017-11-01 Last updated: 2018-01-13

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Marotta, AntonioKassler, Andreas
By organisation
Department of Mathematics and Computer Science
In the same journal
Journal of Network and Computer Applications
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 33 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf