Joint Optimization of Service Function Placement and Flow Distribution for Service Function Chaining

Insun Jang, Dongeun Suh, Sangheon Pack, Gyorgy Dan

Research output: Contribution to journalArticle

19 Citations (Scopus)


In this paper, we consider the problem of optimal dynamic service function (SF) placement and flow routing in a service function chaining (SFC) enabled network. We formulate a multi-objective optimization problem to maximize the acceptable flow rate and to minimize the energy cost for multiple service chains. We transform the multi-objective optimization problem into a single-objective mixed integer linear programming (MILP) problem, and prove that the problem is NP-hard. We propose a polynomial time algorithm based on linear relaxation and rounding to approximate the optimal solution of the MILP. Extensive simulations are conducted to evaluate the effects of the energy budget, the network topology, and the amount of server resources on the acceptable flow rate. The results demonstrate that the proposed algorithm can achieve near-optimal performance and can significantly increase the acceptable flow rate and the service capacity compared to other algorithms under an energy cost budget.

Original languageEnglish
JournalIEEE Journal on Selected Areas in Communications
Publication statusAccepted/In press - 2017 Oct 24


  • acceptable flow rate
  • energy cost
  • flow-compensatory rounding based placement
  • Network topology
  • Optimization
  • Resource management
  • Routing
  • Servers
  • Service function chaining
  • Simulation
  • Transforms

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Joint Optimization of Service Function Placement and Flow Distribution for Service Function Chaining'. Together they form a unique fingerprint.

  • Cite this