桂林电子科技大学学报2024，Vol.44Issue(6)：606-612,7.DOI:10.16725/j.1673-808X.2021206
基于优先级的网络切片映射算法
Priority-based network slice mapping algorithm
摘要
Abstract
A network slice mapping algorithm based on priority and shortest path(PSP)was proposed to solve the problem of long queuing time of high-priority network slices in the process of network slice mapping.The network slice queuing model is modeled as a priority task queue model,and the queue is divided into two queues of high priority and low priority,the mathematical model of the network slice mapping problem is established,and the optimization objective is defined as the network slice delay,the network slice mapping problem is divided into node mapping sub-problem and link mapping sub-problem for solving.In the process of node mapping,the greedy algorithm was adopted to allocate resources with higher performance to network slices with higher priority,and the virtual network functions were mapped to corresponding devices.After the node mapping was completed,the shortest path algo-rithm was used for link mapping.The experimental simulation and result verification analysis of the PSP algorithm show that the PSP algorithm not only significantly reduces the processing delay of the high-priority network slice,but also reduces the overall de-lay of the network slice.关键词
网络切片/优先级/节点映射/链路映射/最短路径Key words
network slicing/priority/node mapping/link mapping/shortest path分类
信息技术与安全科学引用本文复制引用
梁婷婷,张向利..基于优先级的网络切片映射算法[J].桂林电子科技大学学报,2024,44(6):606-612,7.基金项目
广西无线宽带通信与信号处理重点实验室主任基金(GXKL06200104) （GXKL06200104）
广西云计算与大数据协同创新中心(YD1904) （YD1904）
广西自然科学基金(2020GXNSFDA238001) （2020GXNSFDA238001）
