An efficient algorithm for virtual network function placement and chaining

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

Abstract

The virtualized network functions placement and chaining problem is formulated as a decision tree to reduce significantly the complexity of service function chaining (SFC) in clouds. Each node in the tree corresponds to a virtual resource embedding and each tree branch to the mapping of a client request in some physical candidate. This transforms the placement problem to a decision tree search. We devise a new algorithm based on the Monte Carlo Tree Search (MCTS) to incrementally build and search within the decision tree. Thanks to the proposed SFC-MTCS strategy, an optimized solution is computed in a reasonable time. Extensive simulations assess the performance and show that SFC-MCTS outperforms state of the art strategies in terms of: i) acceptance rate, ii) providers revenue and iii) execution time.

Original languageEnglish
Title of host publication2017 14th IEEE Annual Consumer Communications and Networking Conference, CCNC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages647-652
Number of pages6
ISBN (Electronic)9781509061969
DOIs
Publication statusPublished - 17 Jul 2017
Externally publishedYes
Event14th IEEE Annual Consumer Communications and Networking Conference, CCNC 2017 - Las Vegas, United States
Duration: 8 Jan 201711 Jan 2017

Publication series

Name2017 14th IEEE Annual Consumer Communications and Networking Conference, CCNC 2017

Conference

Conference14th IEEE Annual Consumer Communications and Networking Conference, CCNC 2017
Country/TerritoryUnited States
CityLas Vegas
Period8/01/1711/01/17

Keywords

  • Monte-Carlo Tree Search
  • Network Function Virtualization
  • Service Function Chaining

Fingerprint

Dive into the research topics of 'An efficient algorithm for virtual network function placement and chaining'. Together they form a unique fingerprint.

Cite this