Scalable and cost-efficient algorithms for VNF chaining and placement problem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper focuses on placement and chaining of virtualized network functions (VNFs) in Network Function Virtualization Infrastructures (NFVI) for emerging software networks serving multiple tenants. Tenants can request network services to the NFVI in the form of service function chains (in the IETF SFC sense) or VNF Forwarding Graphs (VNF-FG in the case of ETSI) in support of their applications and business. This paper presents efficient algorithms to provide solutions to this NP-Hard chain placement problem to support NFVI providers. Cost-efficient and improved scalability multi-stage graph and 2-Factor algorithms are presented and shown to find near-optimal solutions in few seconds for large instances.

Original languageEnglish
Title of host publicationProceedings of the 2017 20th Conference on Innovations in Clouds, Internet and Networks, ICIN 2017
EditorsStefano Secci, Noel Crespi, Antonio Manzalini
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages92-99
Number of pages8
ISBN (Electronic)9781509036721
DOIs
Publication statusPublished - 13 Apr 2017
Externally publishedYes
Event20th Conference on Innovations in Clouds, Internet and Networks, ICIN 2017 - Paris, France
Duration: 7 Mar 20179 Mar 2017

Publication series

NameProceedings of the 2017 20th Conference on Innovations in Clouds, Internet and Networks, ICIN 2017

Conference

Conference20th Conference on Innovations in Clouds, Internet and Networks, ICIN 2017
Country/TerritoryFrance
CityParis
Period7/03/179/03/17

Keywords

  • Middlebox
  • NFV
  • Optimization
  • Placement
  • SFC

Fingerprint

Dive into the research topics of 'Scalable and cost-efficient algorithms for VNF chaining and placement problem'. Together they form a unique fingerprint.

Cite this