Optimal traffic engineering and placement of virtual machines in SDNs with service chaining

Rung-Hung Gau*

*Corresponding author for this work

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

1 Scopus citations

Abstract

In this paper, we investigate the service capacity of a software-defined network with network function virtualization and service chaining. To obtain and achieve the service capacity, we formulate a mixed integer linear programming problem to jointly optimize the placement of virtual machines and the steering of network flows. In addition, we propose the greedy linear programming relaxation algorithm for efficiently obtaining solutions in three phases based on auxiliary linear programming problems and augmented service paths. We justify the usage of the proposed approach by analytical results and simulation results.

Original languageEnglish
Title of host publication2017 IEEE Conference on Network Softwarization
Subtitle of host publicationSoftwarization Sustaining a Hyper-Connected World: en Route to 5G, NetSoft 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509060085
DOIs
StatePublished - 7 Aug 2017
Event2017 IEEE Conference on Network Softwarization, NetSoft 2017 - Bologna, Italy
Duration: 3 Jul 20177 Jul 2017

Publication series

Name2017 IEEE Conference on Network Softwarization: Softwarization Sustaining a Hyper-Connected World: en Route to 5G, NetSoft 2017

Conference

Conference2017 IEEE Conference on Network Softwarization, NetSoft 2017
CountryItaly
CityBologna
Period3/07/177/07/17

Keywords

  • linear programming
  • network capacity
  • network function virtualization
  • optimal placement
  • service chaining
  • software-defined network
  • traffic engineering

Fingerprint Dive into the research topics of 'Optimal traffic engineering and placement of virtual machines in SDNs with service chaining'. Together they form a unique fingerprint.

Cite this