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
On the Energy Cost of Robustness and Resiliency for Virtual Network Function Placement
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013). (DISCO, Computer networking)ORCID iD: 0000-0002-9446-8143
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013). (DISCO, Computer Networking)ORCID iD: 0000-0001-9194-010X
2018 (English)In: 2018 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN), IEEE, 2018Conference paper, Published paper (Refereed)
Abstract [en]

The placement of Virtual Network Functions (VNF) in distributed data centers is an important problem to solve for the next generation cloud based telecom architectures. This is because where to place the VNFs and how to route the traffic in the physical network impacts the energy consumption of the cloud infrastructure, the resiliency of the service chains and the SLA with the tenants. For network operators, it is important to minimize the operational costs of their infrastructure, provide robustness of the placement and routing in order to cope with potential hardware failures and imprecise resource demand specifications. In this paper, we develop a new optimization model for the green multi-period VNF placement and traffic routing problem, where different service chain configurations exist over time. The model is formulated as a Mixed Integer Linear Program (MILP), considers latency due to network propagation and VNF processing and provides different protection methods for the NFV traffic routing to cope with link failures. By applying Soyster's robustness principle, the model yields a network configuration that can cope with load that deviates from the expected demand. Because the MILP is complex to solve, we develop a fast variable fixing heuristic. In our numerical evaluation, we use the virtualized Evolved Packet Core and study the energy cost of different robustness levels and protection schemes for VNF service flow routing.

Place, publisher, year, edition, pages
IEEE, 2018.
National Category
Computer Sciences Telecommunications
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-71485DOI: 10.1109/NFV-SDN.2018.8725806ISI: 000475896900051Scopus ID: 2-s2.0-85067548613ISBN: 978-1-5386-8281-4 (electronic)OAI: oai:DiVA.org:kau-71485DiVA, id: diva2:1296021
Conference
IEEE Conference on Network Function Virtualization and Software Defined Networks, 27-29 November 2018, Verona, Italy
Projects
NFV Opimizer
Funder
Knowledge Foundation, 20160182Available from: 2019-03-13 Created: 2019-03-13 Last updated: 2019-08-08Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Kassler, AndreasTaheri, Javid

Search in DiVA

By author/editor
Kassler, AndreasTaheri, Javid
By organisation
Department of Mathematics and Computer Science (from 2013)
Computer SciencesTelecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 41 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