University of Oulu

H. Yu, T. Taleb and J. Zhang, "Deterministic Latency/Jitter-Aware Service Function Chaining Over Beyond 5G Edge Fabric," in IEEE Transactions on Network and Service Management, vol. 19, no. 3, pp. 2148-2162, Sept. 2022, doi: 10.1109/TNSM.2022.3151431.

Deterministic latency/jitter-aware service function chaining over beyond 5G edge fabric

Saved in:
Author: Yu, Hao1; Taleb, Tarik1,2; Zhang, Jiawei3
Organizations: 1Center for Wireless Communications, Oulu University, Oulu 90570, Finland
2Department of Computer and Information Security, Sejong University, Seoul 05006, South Korea
3State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, 100876, China
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 1.8 MB)
Persistent link:
Language: English
Published: Institute of Electrical and Electronics Engineers, 2022
Publish Date: 2023-01-03


Deterministic Networking (DetNet) has recently attracted much attention. It aims at studying the deterministic bounded latency and low latency variation for time-sensitive applications (e.g., industrial automation). To improve the quality of service (QoS) guarantee and make the network management efficient, it is desirable for Internet Service Provider (ISP) to obtain an optimal service function chain (SFC) provision strategy while providing deterministic service performance for the time-sensitive applications. In this paper, we will study the deterministic SFC lifetime management problem in beyond 5G edge fabric with the objective of maximizing the overall profits and ensuring the deterministic latency and jitter of SFC requests. We first formulate this problem as a mathematical model with the maximal profits for ISP. Then, the novel Deterministic SFC Deployment algorithm (Det-SFCD) and SFC Adjustment algorithm (Det-SFCA) due to traffic load variation are proposed to efficiently solve the SFC lifetime management problem. Extensive simulation results show that our proposed algorithms can achieve better performance in terms of SFC request acceptance rates, overall profits and latency variation compared with the benchmark algorithm.

see all

Series: IEEE transactions on network and service management
ISSN: 2373-7379
ISSN-E: 1932-4537
ISSN-L: 2373-7379
Volume: 19
Issue: 3
Pages: 2148 - 2162
DOI: 10.1109/tnsm.2022.3151431
Type of Publication: A1 Journal article – refereed
Field of Science: 213 Electronic, automation and communications engineering, electronics
Funding: This work was partially supported by the European Unions Horizon 2020 Research and Innovation Program through the MonB5G Project under Grant No. 871780. It was also supported in part by the Academy of Finland 6Genesis project under Grant No. 318927 and IDEA-MILL with grant number 33593.
Academy of Finland Grant Number: 318927
Detailed Information: 318927 (Academy of Finland Funding decision)
Copyright information: © 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.