Order dependency-aware service function placement in service function chaining

Hosung Baek, Insun Jang, Haneul Ko, Sangheon Pack

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

2 Citations (Scopus)

Abstract

In distributed network function virtualization (NFV) environments, the latency can be significantly increased as the length of service function chain (SFC) increases. To reduce the latency, the order dependency allowing parallel processing of service functions (SFs) can be exploited. In this paper, we propose an order dependency-aware SF placement scheme and analyze its advantages and challenges compared with conventional ones.

Original languageEnglish
Title of host publicationInternational Conference on Information and Communication Technology Convergence
Subtitle of host publicationICT Convergence Technologies Leading the Fourth Industrial Revolution, ICTC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages193-195
Number of pages3
Volume2017-December
ISBN (Electronic)9781509040315
DOIs
Publication statusPublished - 2017 Dec 12
Event8th International Conference on Information and Communication Technology Convergence, ICTC 2017 - Jeju Island, Korea, Republic of
Duration: 2017 Oct 182017 Oct 20

Other

Other8th International Conference on Information and Communication Technology Convergence, ICTC 2017
CountryKorea, Republic of
CityJeju Island
Period17/10/1817/10/20

Keywords

  • parallelism
  • service function (SF) placement
  • Service function chain (SFC)
  • service node (SN)

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Information Systems
  • Information Systems and Management

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

Cite this