Hang Li, Zixuan Kong, Wan Xiang, X. Wen, Zhaoming Lu, Luhan Wang, Yawen Chen, Wenpeng Jing
{"title":"Slice-Based Service Function Chain Embedding with Multiple Factors","authors":"Hang Li, Zixuan Kong, Wan Xiang, X. Wen, Zhaoming Lu, Luhan Wang, Yawen Chen, Wenpeng Jing","doi":"10.1109/GCWkshps52748.2021.9682023","DOIUrl":null,"url":null,"abstract":"Network slicing is a promising technology to provide various services on a common physical network infrastructure. A network slice is a logical virtual network composed of a group of service function chains (SFCs) and the network operator performs SFC embedding (SFCE) to create and orchestrate network slices. Compared to conventional SFCE, implementing slice-based SFCE (SBSFCE) faces some new challenges like diversified requirements of SFCs, inter-slice and intra-slice VNF sharing, and slice priority-based admission control due to the introduction of slice dimension. In this paper, we study the SBSFCE problem jointly considering the above challenges. We formulate the problem and devise a dynamic programming-based heuristic, SBSEA to solve it. The simulation results demonstrate that SBSEA outperforms the existing solution and achieves near-optimal performance.","PeriodicalId":6802,"journal":{"name":"2021 IEEE Globecom Workshops (GC Wkshps)","volume":"65 1 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE Globecom Workshops (GC Wkshps)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCWkshps52748.2021.9682023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Network slicing is a promising technology to provide various services on a common physical network infrastructure. A network slice is a logical virtual network composed of a group of service function chains (SFCs) and the network operator performs SFC embedding (SFCE) to create and orchestrate network slices. Compared to conventional SFCE, implementing slice-based SFCE (SBSFCE) faces some new challenges like diversified requirements of SFCs, inter-slice and intra-slice VNF sharing, and slice priority-based admission control due to the introduction of slice dimension. In this paper, we study the SBSFCE problem jointly considering the above challenges. We formulate the problem and devise a dynamic programming-based heuristic, SBSEA to solve it. The simulation results demonstrate that SBSEA outperforms the existing solution and achieves near-optimal performance.