SFC Provisioning over NFV Enabled Clouds

Chaima Ghribi, Marouen Mechtri, Oussama Soualah, Djamal Zeghlache

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

Abstract

This paper deals with virtualised Network Function Placement and chaining over cloud and NFV environments. We propose a polynomial-time algorithm for joint VNF chain placement that is based on a recursive optimization approach. The key idea is to benefit from the robustness of the recursion paradigm that was used to solve many optimization problems. We demonstrate the potential of our solution by comparing it to previous work. We conduct performance evaluation first through extensive simulations and then using a real cloud testbed. The obtained results show that our proposed algorithm achieves better performance in terms of resource usage, execution time, acceptance rate and revenue of the cloud provider.

Original languageEnglish
Title of host publicationProceedings - 2017 IEEE 10th International Conference on Cloud Computing, CLOUD 2017
EditorsGeoffrey C. Fox
PublisherIEEE Computer Society
Pages423-430
Number of pages8
ISBN (Electronic)9781538619933
DOIs
Publication statusPublished - 8 Sept 2017
Externally publishedYes
Event10th IEEE International Conference on Cloud Computing, CLOUD 2017 - Honolulu, United States
Duration: 25 Jun 201730 Jun 2017

Publication series

NameIEEE International Conference on Cloud Computing, CLOUD
Volume2017-June
ISSN (Print)2159-6182
ISSN (Electronic)2159-6190

Conference

Conference10th IEEE International Conference on Cloud Computing, CLOUD 2017
Country/TerritoryUnited States
CityHonolulu
Period25/06/1730/06/17

Keywords

  • NFV
  • Service Function Chaining
  • recursive approach

Fingerprint

Dive into the research topics of 'SFC Provisioning over NFV Enabled Clouds'. Together they form a unique fingerprint.

Cite this