Optimal placement of service function in service function chaining

Haneul Ko, Dongeun Suh, Hosung Baek, Sangheon Pack, Jiyoung Kwak

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

In service function chaining (SFC), an ordered list of service functions (SFs) is specified for network services, and those SFs should be placed in appropriate service nodes (SNs) to satisfy the given service latency requirement. In this paper, we formulate an integer non-linear programming (INLP) problem for the optimal placement of SFs when the latency requirement for network services and network conditions (e.g., link latency and SN capacity) are given. Evaluation results show that the optimal placement can achieve lower latency than conventional schemes.

Original languageEnglish
Title of host publicationICUFN 2016 - 8th International Conference on Ubiquitous and Future Networks
PublisherIEEE Computer Society
Pages102-105
Number of pages4
Volume2016-August
ISBN (Electronic)9781467399913
DOIs
Publication statusPublished - 2016 Aug 9
Event8th International Conference on Ubiquitous and Future Networks, ICUFN 2016 - Vienna, Austria
Duration: 2016 Jul 52016 Jul 8

Other

Other8th International Conference on Ubiquitous and Future Networks, ICUFN 2016
CountryAustria
CityVienna
Period16/7/516/7/8

Keywords

  • integer non-linear program (INLP)
  • placement
  • service function (SF)
  • Service function chaining (SFC)
  • service node (SN)

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Optimal placement of service function in service function chaining'. Together they form a unique fingerprint.

  • Cite this

    Ko, H., Suh, D., Baek, H., Pack, S., & Kwak, J. (2016). Optimal placement of service function in service function chaining. In ICUFN 2016 - 8th International Conference on Ubiquitous and Future Networks (Vol. 2016-August, pp. 102-105). [7536993] IEEE Computer Society. https://doi.org/10.1109/ICUFN.2016.7536993