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 |
---|---|
Article number | 9286738 |
Pages (from-to) | 7155-7164 |
Number of pages | 10 |
Journal | IEEE Transactions on Industrial Informatics |
Volume | 17 |
Issue number | 10 |
DOIs | |
Publication status | Published - 8 Dec 2021 |
Bibliographical note
Funding Information:Manuscript received April 20, 2020; revised December 3, 2020; accepted December 3, 2020. Date of publication December 8, 2020; date of current version June 30, 2021. 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. Paper no. TII-20-2023. (Corresponding author: Gang Sun; Hongfang Yu.) Gang Sun is with the Key Laboratory of Optical Fiber Sensing and Communications (Ministry of Education), University of Electronic Science and Technology of China, Chengdu 611731, China, and also with the Agile and Intelligent Computing Key Laboratory of Sichuan Province, Chengdu 611731, China (e-mail: [email protected]).
Publisher Copyright:
© 2005-2012 IEEE.