Abstract
Network function virtualization (NFV) in 6G can use standard virtualization techniques to enable network functions via software. Resource scheduling is one of the key research areas of NFV in 6G and is mainly used to deploy service function chains (SFCs) in substrate networks. However, determining how to utilize network resources efficiently has always been a difficult problem in SFC deployment. This article focuses on how to efficiently provision online SFC requests in NFV with 6G. We first establish a mathematical model for the problem of online SFC provisioning. Then, we propose an efficient online service function chain deployment (OSFCD) algorithm that selects the path to deploy that is close to the SFC length. Finally, we compare our proposed algorithm with three other existing algorithms by simulation experiments. The experimental results show that the OSFCD algorithm optimizes multiple performance indicators of online SFC deployment.
| Original language | English |
|---|---|
| Pages (from-to) | 7155-7164 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Industrial Informatics |
| Volume | 17 |
| Issue number | 10 |
| Early online date | 8 Dec 2020 |
| DOIs | |
| Publication status | Published - 1 Oct 2021 |
Bibliographical note
© 2020 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.Funding Information:
This work was supported in part by the National Key Research and Development Program of China under Grant 2019YFB1802800 and in part by the PCL Future Greater-Bay Area Network Facilities for Large-scale Experiments and Applications under Grant PCL2018KP001.
Keywords
- 6G
- latency
- network function provisioning
- network in box
- resource efficiency