Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • apa.csl
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
On the Energy Cost of Robustness and Resiliency for Virtual Network Function Placement
Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013). (DISCO, Computer networking)ORCID-id: 0000-0002-9446-8143
Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013). (DISCO, Computer Networking)ORCID-id: 0000-0001-9194-010X
2018 (engelsk)Inngår i: 2018 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN), IEEE, 2018Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
IEEE, 2018.
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
URN: urn:nbn:se:kau:diva-71485DOI: 10.1109/NFV-SDN.2018.8725806ISI: 000475896900051Scopus ID: 2-s2.0-85067548613ISBN: 978-1-5386-8281-4 (digital)OAI: oai:DiVA.org:kau-71485DiVA, id: diva2:1296021
Konferanse
IEEE Conference on Network Function Virtualization and Software Defined Networks, 27-29 November 2018, Verona, Italy
Prosjekter
NFV Opimizer
Forskningsfinansiär
Knowledge Foundation, 20160182Tilgjengelig fra: 2019-03-13 Laget: 2019-03-13 Sist oppdatert: 2019-08-08bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Kassler, AndreasTaheri, Javid

Søk i DiVA

Av forfatter/redaktør
Kassler, AndreasTaheri, Javid
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 214 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • apa.csl
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf