面向多样化需求的网络切片业务链部署

doi:10.13190/j.jbupt.2021-165

北京邮电大学学报 ›› 2022, Vol. 45 ›› Issue (2): 9-15.doi: 10.13190/j.jbupt.2021-165

面向多样化需求的网络切片业务链部署

李航, 温向明, 孔紫璇, 向万, 王鲁晗

1. 北京邮电大学信息与通信工程学院, 北京 100876;
2. 北京邮电大学网络体系构建与融合北京市重点实验室, 北京 100876;
3. 北京邮电大学先进信息网络北京实验室, 北京 100876

收稿日期:2021-08-06 发布日期:2021-12-16
通讯作者: 王鲁晗(1989—),男,讲师,硕士生导师,邮箱:wluhan@bupt.edu.cn。 E-mail:wluhan@bupt.edu.cn
作者简介:李航(1994—),男,博士生。
基金资助:
国家重点研发计划项目(2019YFB1803301);北京市自然科学基金项目(L202002);国家自然科学基金项目(61801036)

Service Function Chain Embedding for Network Slicing with Diversified Requirements

LI Hang, WEN Xiangming, KONG Zixuan, XIANG Wan, WANG Luhan

1. School of Information and Communications Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China;
2. Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, Beijing 100876, China;
3. Beijing Laboratory of Advanced Information Networks, Beijing University of Posts and Telecommunications, Beijing 100876, China

Received:2021-08-06 Published:2021-12-16

摘要/Abstract

摘要： 网络切片通过业务链部署来实现切片的创建和编排。针对网络切片中的业务链部署,考虑了业务链的多样化需求,并引入了虚拟网络功能共享和准入控制,以降低部署成本并提高业务链的接受率。将上述问题建模成一个最大化网络净收益的优化模型,提出了部署算法。仿真结果表明,所提的部署算法优于已有的基准算法,能达到接近最优的性能。

关键词: 网络切片, 业务链部署, 虚拟网络功能, 启发式算法

Abstract: Network slicing realizes the creation and orchestration of slices through service function chain embedding. However, the service function chain embedding in network slicing should consider diversified requirements of service function chains, reduce deployment costs and increase the acceptance ratio by taking virtual network function sharing and admission control into consideration. The service chain embedding for network slicing with diversified requirements is studied, where virtual network function sharing and admission control are introduced. First, the above problem is formulated as an optimization model that maximizes the network net revenue, and then an embedding algorithm is devised. The simulation results show that the proposed algorithm outperforms the existing benchmark algorithm, and achieves near-optimal performance.

Key words: network slicing, service function chain embedding, virtual network function, heuristic algorithm

中图分类号:

TP393.0

李航, 温向明, 孔紫璇, 向万, 王鲁晗. 面向多样化需求的网络切片业务链部署[J]. 北京邮电大学学报, 2022, 45(2): 9-15.

LI Hang, WEN Xiangming, KONG Zixuan, XIANG Wan, WANG Luhan. Service Function Chain Embedding for Network Slicing with Diversified Requirements[J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(2): 9-15.

参考文献

[1] ZHANG H, LIU N, CHU X, et al. Network slicing based 5G and future mobile networks:mobility, resource management, and challenges[J]. IEEE Communications Magazine, 2017, 55(8):138-145.
[2] QUINN P, NADEAU T. Problem statement for service function chaining:IETF technique report:RFC 7498[R/OL].(2018-12-20)[2021-07-01]. https://data-tracker.ietf.org/doc/rfc7498/.
[3] LAGHRISSI A, TALEB T. A survey on the placement of virtual resources and virtual network functions[J]. IEEE Communications Surveys and Tutorials, 2018, 21(2):1409-1434.
[4] LI H, KONG Z, XIANG W, et al. Slice-based service function chain embedding with multiple factors[C]//2021 IEEE Globecom Workshops (GC Wkshps). Piscataway,NJ:IEEE Press, 2021:1-6.
[5] SERIES M. Minimum requirements related to technical performance for IMT-2020 radio interface (s):ITU-R report:M.2410-0[R/OL].(2017-11-16)[2021-07-01]. https://www.itu.int/dms_pub/itu-r/opb/rep/R-REP-M.2410-2017-PDF-E.pdf.
[6] PAPAGIANNI C, PAPADIMITRIOU P, BARAS J S. Rethinking service chain embedding for cellular network slicing[C]//2018 IFIP Networking Conference (IFIP Networking) and Workshops. Piscataway, NJ:IEEE Press, 2018:1-9.
[7] TRUONG-HUU T, MOHAN P M, GURUSAMY M. Ser-vice chain embedding for diversified 5G slices with virtual network function sharing[J]. IEEE Communications Letters, 2019, 23(5):826-829.
[8] NEJAD M A T, PARSAEEFARD S, MADDAH-ALI M A, et al. vSPACE:VNF simultaneous placement, admission control and embedding[J]. IEEE Journal on Selected Areas in Communications, 2018, 36(3):542-557.
[9] ZHANG N, LIU Y F, FARMANBAR H, et al. Network slicing for service-oriented networks under resource constraints[J]. IEEE Journal on Selected Areas in Communications, 2017, 35(11):2512-2521.
[10] CHEN W K, LIU Y F, DOMENICO A D, et al. Optimal network slicing for service-oriented networks with flexible routing and guaranteed E2E latency[J]. IEEE Transactions on Network and Service Management, 2021, 18(4):4337-4352.
[11] XIE Y, WANG S, DAI Y. Revenue-maximizing virtualized network function chain placement in dynamic environment[J]. Future Generation Computer Systems, 2020, 108:650-661.
[12] ROST M, SCHMID S. Charting the complexity landscape of virtual network embeddings[C]//2018 IFIP Networking Conference (IFIP Networking) and Workshops. Piscataway, NJ:IEEE Press, 2018:1-9.
[13] DIJKSTRA E W. A note on two problems in connexion with graphs[J]. Numerische Mathematik, 1959, 1(1):269-271.
[14] WAXMAN B M. Routing of multipoint connections[J]. IEEE Journal on Selected Areas in Communications, 1988, 1(3):286-292.

面向多样化需求的网络切片业务链部署

Service Function Chain Embedding for Network Slicing with Diversified Requirements

RichHTML

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 12

编辑推荐

Metrics

本文评价

[1]	吴玄姬伟峰翁江李映岐申秀雨. 面向网络切片的无证书切换认证与密钥协商协议[J]. 北京邮电大学学报, 2023, 46(4): 103-108.
[2]	公雨魏翼飞. 一种集成学习辅助DDPG的资源优化算法[J]. 北京邮电大学学报, 2023, 46(2): 29-36.
[3]	孔紫璇李航向万陈亚文郑伟. 用户动态接入下的多播业务链部署和调整方法[J]. 北京邮电大学学报, 2022, 45(6): 55-61.
[4]	郑远鹏, 张天魁, 朱光宇, 沈鸿. MEC系统中面向网络切片的3C联合资源分配算法[J]. 北京邮电大学学报, 2021, 44(5): 41-47.
[5]	管婉青, 张海君, 路兆铭. 基于DRL的6G多租户网络切片智能资源分配算法[J]. 北京邮电大学学报, 2020, 43(6): 132-139.
[6]	李强, 鲁昌龙, 曹斌, 张钦宇. 基于网络切片的高频谱效率无线资源管理[J]. 北京邮电大学学报, 2019, 42(4): 50-56.
[7]	唐伦, 杨恒, 赵国繁, 王耀玮, 陈前斌. 基于时延感知的5G网络切片节点和链路映射算法[J]. 北京邮电大学学报, 2018, 41(6): 71-77.
[8]	马璐, 王鲁晗, 陈炜, 温向明, 王少春. 服务化的5G核心网切片管理系统研究与实现[J]. 北京邮电大学学报, 2018, 41(5): 78-85.
[9]	许蒙蒙, 徐恒舟, 朱海, 王宝凤. 网络连通度约束下低开销的拓扑控制[J]. 北京邮电大学学报, 2018, 41(5): 126-130.
[10]	朱敬华, 尹旭明, 王楠, 李金宝, 吴志强. 无线传感网移动数据收集路径规划算法[J]. 北京邮电大学学报, 2016, 39(3): 110-113.
[11]	彭海云, 候燕. 路径重链接的GRASP最优化无线自组织网络能耗[J]. 北京邮电大学学报, 2015, 38(4): 122-127.
[12]	忻展红, 吴启程, 莫文冬. 七号信令网的A／B平面划分问题及其启发式解法[J]. 北京邮电大学学报, 2001, 24(1): 22-27.